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 …

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 …

We propose a new filtering algorithm for the cumulative constraint. It applies the Edge-
Finding, the Extended-Edge-Finding and the Time-Tabling rules in O (kn log n) where k is …

Abstract Development of a computationally-tractable design method for combined multi-
physics optimization of packing and routing problems, at a relevant scale, within compact …

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 …

We consider the 2D orthogonal feasibility problem (OPP-2) and the 2D strip packing
problem (SPP-2). Given a set of rectangular items, the OPP-2 is to decide whether all items …

We consider the feasibility problem in d‐dimensional orthogonal packing (d2), called the
Orthogonal Packing Problem (OPP): given a set of d‐dimensional rectangular items, decide …

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 …

Recently, we compared the performance of mixed-integer programming (MIP), constraint
programming (CP), and constraint integer programming (CIP) to a state-of-the-art logic …