This paper presents a new constraint programming search algorithm that is designed for a
broad class of scheduling problems. Failure-directed Search (FDS) assumes that there is no …

When solving a combinatorial problem, the formulation or model of the problem is critical to
the efficiency of the solver. Automating the modelling process has long been of interest …

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 …

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 …

Table Constraints are very useful for modeling combinatorial problems in Constraint
Programming (CP). They are a universal mechanism for representing constraints, but …

This article introduces a combinatorial optimization approach to register allocation and
instruction scheduling, two central compiler problems. Combinatorial optimization has the …

Much of the power of CP comes from the ability to create complex hybrid search algorithms
specific to an application. Unfortunately there is no widely accepted standard for specifying …

In the perfect rectangle packing problem, a set of rectangular items have to be placed inside
a rectangular container without overlap or empty space. In this paper, we generate a large …

Constraint propagation is one of the key techniques in constraint programming, and a large
body of work has built up around it. Special-purpose constraint propagation algorithms …

The rectangle packing problem consists of finding an enclosing rectangle of smallest area
that can contain a given set of rectangles without overlap. Our algorithm picks the x …