A Bockmayr, JN Hooker - Handbooks in Operations Research and …, 2005 - Elsevier
Constraint programming (CP) methods exhibit several parallels with branch-and-cut methods for mixed integer programming (MIP). Both generate a branching tree. Both use …
C Duhamel, P Lacomme, A Quilliot… - Computers & Operations …, 2011 - Elsevier
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 (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential …
E Huang, RE Korf - Journal of Artificial Intelligence Research, 2013 - jair.org
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 …
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 …
N Beldiceanu, M Carlsson - … Conference on Principles and Practice of …, 2002 - Springer
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 …
H Simonis, B O'Sullivan - … Conference on Principles and Practice of …, 2008 - Springer
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 …