2. A MiniZinc Tutorial

• 2.1. Basic Modelling in MiniZinc
  • 2.1.1. Our First Example
  • 2.1.2. An Arithmetic Optimisation Example
  • 2.1.3. Datafiles and Assertions
  • 2.1.4. Real Number Solving
  • 2.1.5. Basic structure of a model
• 2.2. More Complex Models
  • 2.2.1. Arrays and Sets
  • 2.2.2. Global Constraints
  • 2.2.3. Conditional Expressions
  • 2.2.4. Enumerated Types
  • 2.2.5. Complex Constraints
  • 2.2.6. Array Access Constraints
  • 2.2.7. Partiality and Relational Semantics
  • 2.2.8. Set Constraints
  • 2.2.9. Putting it all together
• 2.3. Predicates and Functions
  • 2.3.1. Global Constraints
    • 2.3.1.1. Alldifferent
    • 2.3.1.2. Cumulative
    • 2.3.1.3. Table
    • 2.3.1.4. Regular
  • 2.3.2. Defining Predicates
  • 2.3.3. Defining Functions
  • 2.3.4. Reflection Functions
  • 2.3.5. Local Variables
  • 2.3.6. Context
  • 2.3.7. Local Constraints and Partiality
  • 2.3.8. Domain Reflection Functions
  • 2.3.9. Scope
• 2.4. Option Types
  • 2.4.1. Declaring and Using Option Types
  • 2.4.2. Option Types in Scheduling Problems
  • 2.4.3. Hidden Option Types
  • 2.4.4. Option Type Parameters
• 2.5. Tuple and record types
  • 2.5.1. Declaring and using tuples and records
  • 2.5.2. Using type-inst synonyms
  • 2.5.3. Types with both var and par members
  • 2.5.4. Example: rectangle packing using records
• 2.6. Search
  • 2.6.1. Finite Domain Search
  • 2.6.2. Search Annotations
  • 2.6.3. Annotations
  • 2.6.4. Restart
  • 2.6.5. Warm Starts
• 2.7. Effective Modelling Practices in MiniZinc
  • 2.7.1. Variable Bounds
  • 2.7.2. Effective Generators
  • 2.7.3. Redundant Constraints
  • 2.7.4. Modelling Choices
  • 2.7.5. Multiple Modelling and Channels
  • 2.7.6. Symmetry
    • 2.7.6.1. Static Symmetry Breaking
    • 2.7.6.2. Other Examples of Symmetry
• 2.8. Boolean Satisfiability Modelling in MiniZinc
  • 2.8.1. Modelling Integers
  • 2.8.2. Modelling Disequality
  • 2.8.3. Modelling Cardinality
• 2.9. FlatZinc and Flattening
  • 2.9.1. Flattening Expressions
    • 2.9.1.1. Simplification and Evaluation
    • 2.9.1.2. Defining Subexpressions
    • 2.9.1.3. FlatZinc constraint form
    • 2.9.1.4. Bounds analysis
    • 2.9.1.5. Objectives
  • 2.9.2. Linear Expressions
  • 2.9.3. Unrolling Expressions
  • 2.9.4. Arrays
  • 2.9.5. Reification
  • 2.9.6. Predicates
  • 2.9.7. Let Expressions