An improved best-fit heuristic for the orthogonal strip packing problem
Year of publication: |
2013
|
---|---|
Authors: | Verstichel, Jannes ; De Causmaecker, Patrick ; Vanden Berghe, Greet |
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. 20.2013, 5, p. 711-730
|
Subject: | heuristics | cutting stock | optimization | packing problems | Heuristik | Heuristics | Packproblem | Packing problem | Theorie | Theory | Algorithmus | Algorithm | Operations Research | Operations research |
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
-
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Delorme, Maxence, (2020)
-
A column generation-based heuristic for the three-dimensional bin packing problem with rotation
Mahvash, Batoul, (2018)
- More ...
-
The generalized lock scheduling problem : an exact approach
Verstichel, Jannes, (2014)
-
Exact and heuristic methods for placing ships in locks
Verstichel, Jannes, (2014)
-
An improved bestāfit heuristic for the orthogonal strip packing problem
Verstichel, Jannes, (2013)
- More ...