Sciweavers

360 search results - page 5 / 72
» The TV-Break Packing Problem
Sort
View
COR
2008
133views more  COR 2008»
13 years 7 months ago
A new constraint programming approach for the orthogonal packing problem
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 ...
François Clautiaux, Antoine Jouglet, Jacque...
ENDM
2010
127views more  ENDM 2010»
13 years 7 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
13 years 7 months ago
Jamming and Geometric Representations of Graphs
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...
Werner Krauth, Martin Loebl
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
FCT
2005
Springer
14 years 27 days ago
The Maximum Resource Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...