Sciweavers

1542 search results - page 13 / 309
» Kernelization of packing problems
Sort
View
IMECS
2007
13 years 9 months ago
Genetic Algorithms for the Nesting Problem in the Packing Industry
— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are pack...
Roberto Selow, Flavio Neves Junior, Heitor S. Lope...
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 7 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
14 years 5 months ago
The forest hiding problem
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
Adrian Dumitrescu, Minghui Jiang
COR
2006
86views more  COR 2006»
13 years 7 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
PPSN
1998
Springer
13 years 11 months ago
Genetic Algorithms for the Multiple Container Packing Problem
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...
Günther R. Raidl, Gabriele Kodydek