Part M
Modeling
This part explains modeling and solving constraint problems, and how to program, compile, link, and execute constraint models.
Basic material. The basic material needed for modeling with Gecode is as follows:
Getting started provides an overview of how to program, compile, link, and execute a constraint model in Gecode.
Getting comfortable discusses functionality in Gecode that makes modeling and execution of models more convenient.
The first three sections of Integer and Boolean variables and constraints explain integer and Boolean variables (Integer and Boolean variables), variable and argument arrays (Variable and argument arrays), and how constraints are posted (Posting constraints).
The first section of Set variables and constraints gives an overview of set variables (Set variables).
The first section of Float variables and constraints gives an overview of float variables (Float variables).
The first sections of Branching explain branching: basics (Branching basics), branchings for integer and Boolean variables (Branching on integer and Boolean variables), branchings for set variables (Branching on set variables), and branchings for float variables (Branching on float variables).
Even though not strictly necessary for modeling, it is recommended to also read Hybrid recomputation and Parallel search, which explain how search—and in particular parallel search—works in Gecode.
Case studies features a collection of example models for Gecode as further reading.
Overview material. The remaining chapters and sections provide an overview of the available functionality for modeling and solving:
Constraints on integer and Boolean variables are summarized in Constraint overview and Synchronized execution of Integer and Boolean variables and constraints.
Constraint overview and Synchronized execution of Set variables and constraints summarize constraints on set variables.
Constraint overview and Synchronized execution of Float variables and constraints summarize constraints on float variables.
Modeling convenience: MiniModel provides an overview of modeling convenience implemented by MiniModel.
Open variable lists explains lists whose length is decided during search, using simple routes as an example.
The remaining sections of Branching discuss more advanced topics for branchings: local versus shared variable selection (Local versus shared variable selection criteria), random selection (Random variable and value selection), user-defined variable (User-defined variable selection) and value (User-defined value selection) selection, tie-breaking (Tie-breaking), assigning variables (Assigning integer, Boolean, set, and float variables), and executing code between branchers (Executing code between branchers).
Search engines of Search summarizes how to use search engines.
Gist summarizes how to use Gist as a graphical and interactive search tool for developing constraint models.
Script commandline driver summarizes the command-line driver for Gecode models.
Groups and tracing explains how to use groups for tracing constraint propagation.