An improved typology of cutting and packing problems
- 16 December 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 183 (3), 1109-1130
- https://doi.org/10.1016/j.ejor.2005.12.047
Abstract
No abstract availableThis publication has 100 references indexed in Scilit:
- On the two-dimensional Knapsack ProblemOperations Research Letters, 2004
- Solving nesting problems with non-convex polygons by constraint logic programmingInternational Transactions in Operational Research, 2003
- 3D random stacking of weakly heterogeneous palletization problemsInternational Journal of Production Research, 1999
- A Best-first Branch-and-bound Algorithm for Orthogonal Rectangular Packing ProblemsInternational Transactions in Operational Research, 1998
- On-line packing with boxes of different sizesInternational Journal of Production Research, 1998
- A simple and effective recursive procedure for the manufacturer's pallet loading problemJournal of the Operational Research Society, 1998
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraintsInternational Transactions in Operational Research, 1998
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- Heuristiken zur Lösung des zweidimensionalen Packproblems für RundgefäßeOR Spectrum, 1991
- A Combined Approach to the Pallet Loading ProblemIIE Transactions, 1982