Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
Year of publication: 
20060701


Authors:  Kubach, Timo ; Bortfeldt, Andreas ; Gehring, Hermann 
Publisher: 
Fernuniversität <Hagen> / Fakultät Wirtschaftswissenschaft 
Subject:  Algorithmus  Parallelisierung 
 1. Introduction
 2. Problem definitions
 3. Literature overview
 4. Developed algorithms
 4.1 Algorithm B1.6_KP for the Knapsack Problem
 4.2 Algorithm B1.6_SPP for the Strip Packing Problem
 5. Parallelization of the algorithms
 6. New benchmark instances
 7. Experimental results and analysis
 7.1 Results and analysis for the new benchmark instances
 7.2 Comparisons to other algorithms
 8. Summary

Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
Kubach, Timo, (2009)

Feinkörnig parallele genetische Algorithmen
Kohlmorgen, Udo, (1999)

A Parallel Twophase Metaheuristic for Routing Problems with Time Windows
Gehring, Hermann, (2001)
 More ...

Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
Kubach, Timo, (2009)

Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
Kubach, Timo, (2009)

Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
Kubach, Timo, (2006)
 More ...