Sciweavers

439 search results - page 6 / 88
» Genetic Algorithms for the Multiple Container Packing Proble...
Sort
View
EOR
2007
97views more  EOR 2007»
14 years 11 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...
58
Voted
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
15 years 5 months ago
ExGA II: an improved exonic genetic algorithm for the multiple knapsack problem
Philipp Rohlfshagen, John A. Bullinaria
107
Voted
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
15 years 5 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
58
Voted
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
15 years 9 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
90
Voted
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
14 years 11 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius