Sciweavers

1542 search results - page 7 / 309
» Kernelization of packing problems
Sort
View
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 1 months 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 ...
MOR
2006
123views more  MOR 2006»
13 years 7 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...