Using finite domain integers
[Interfacing to Gecode/J]

Collaboration diagram for Using finite domain integers:

Modules

Domain constraints

Simple relation constraints

Equality constraints

Element constraints

Distinct constraints

Channel constraints

Scheduling constraints

Regular constraints

Cardinality constraints

Note:
Domain consistency on the extended cardinality variables of the Global Cardinality Propagator is only obtained if they are bounds consistent, otherwise the problem of enforcing domain consistency on the cardinality variables is NP-complete as proved by CardVarNPCompl Qumiper et.

Boolean constraints

Arithmetic constraints

Linear constraints

All variants for linear constraints share the following properties:

Bounds-consistency (over the real numbers) is supported for all constraints (actually, for disequlities always domain-consistency is used as it is cheaper).

Branching

Integer variables


Modules
	Domain constraints
	Simple relation constraints
	Equality constraints
	Element constraints
	Distinct constraints
	Channel constraints
	Scheduling constraints
	Regular constraints
	Cardinality constraints
	Note: Domain consistency on the extended cardinality variables of the Global Cardinality Propagator is only obtained if they are bounds consistent, otherwise the problem of enforcing domain consistency on the cardinality variables is NP-complete as proved by CardVarNPCompl Qumiper et.
	Boolean constraints
	Arithmetic constraints
	Linear constraints
	All variants for linear constraints share the following properties: Bounds-consistency (over the real numbers) is supported for all constraints (actually, for disequlities always domain-consistency is used as it is cheaper).
	Branching
	Integer variables

Modules