Upper bounds for heuristic approaches to the strip packing problem
Year of publication: |
January/March 2016
|
---|---|
Authors: | Buchwald, Torsten ; Scheithauer, Guntram |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 1/2, p. 93-119
|
Subject: | cutting and packing | strip packing problem | performance ratio | Packproblem | Packing problem | Heuristik | Heuristics | Operations Research | Operations research | Algorithmus | Algorithm | Theorie | Theory |
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
-
A clique covering MIP model for the irregular strip packing problem
Rodrigues, Marcos Okamura, (2017)
- More ...
-
Relations between capacity utilization, minimal bin size and bin number
Buchwald, Torsten, (2014)
-
An introduction to stochastic bin packing-based server consolidation with conflicts
Martinovic, John, (2021)
-
New cases of the cutting stock problem having MIRUP
Nitsche, Christoph, (1998)
- More ...