Global Constraint Catalogue: Past, Present and Future Page 1 Constraints (2007) 12:21–62 DOI
10.1007/s10601-006-9010-8 Global Constraint Catalogue: Past, Present and Future Nicolas …

Constraint programming (CP) methods exhibit several parallels with branch-and-cut
methods for mixed integer programming (MIP). Both generate a branching tree. Both use …

This paper addresses an extension of the capacitated vehicle routing problem where
customer demand is composed of two-dimensional weighted items (2L-CVRP). The …

We consider the NP-complete problem of finding an enclosing rectangle of minimum area
that will contain a given a set of rectangles. We present two different constraint-satisfaction …

Register allocation (map** variables to processor registers or memory) and instruction
scheduling (reordering instructions to increase instruction-level parallelism) are essential …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

We consider the problem of finding all enclosing rectangles of minimum area that can
contain a given set of rectangles without overlap. Our rectangle packer chooses the x …

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of
rectangles can be packed in a larger rectangle of fixed size. We propose an exact method …

This paper presents a new cumulatives constraint, which generalizes the original cumulative
constraint in different ways. The two most important aspects consist in permitting multiple …

Rectangle (square) packing problems involve packing all squares with sizes 1× 1 to n× n
into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a …