CORR
2004
Springer
13 years 4 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
COMBINATORICS
2006
13 years 4 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
13
Voted
ANOR
2010
13 years 4 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
CP
2008
Springer
13 years 5 months ago
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...
CSCLP
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...