The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
From MaRDI portal
Publication:3842995
DOI10.1111/j.1475-3995.1997.tb00093.xzbMath0906.90151MaRDI QIDQ3842995
Gerhard Wäscher, Petra Schwerin
Publication date: 20 August 1998
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00093.x
90C27: Combinatorial optimization
Related Items
New bin packing fast lower bounds, Solving the one-dimensional bin packing problem with a weight annealing heuristic, An improved typology of cutting and packing problems
Uses Software
Cites Work
- An instance of the cutting stock problem for which the rounding property does not hold
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- A typology of cutting and packing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study