FCT
2007
Springer
13 years 8 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
PPSN
1998
Springer
13 years 8 months ago
1998
Springer
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
WAOA
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
IFIP
2004
Springer
13 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...