Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
Year of publication: |
2009
|
---|---|
Authors: | Kubach, T. ; Bortfeldt, Andreas ; Gehring, Hermann |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 17.2009, 4, p. 461-477
|
Subject: | Packproblem | Packing problem | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Theorie | Theory |
-
A heuristic approach to the warehouse management problem : a real case study
Mezghani, Salma, (2012)
-
Determining the best shipper sizes for sending products to customers
Alonso, Maria Teresa, (2016)
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
- More ...
-
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
Kubach, T., (2009)
-
Ein verteilt-paralleler genetischer Algorithmusfür Containerbeladeprobleme
Gehring, Hermann, (1999)
-
Gehring, Hermann, (1998)
- More ...