Bin packing and cutting stock problems: Mathematical models and exact algorithms
Authors:
- Maxence DelormeMDMaxence Delorme
- Manuel IoriMIManuel Iori
- Silvano MartelloSMSilvano Martello
Top Cited Papers
- 1 November 2016
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 255 (1) , 1-20
Abstract
No abstract availableKeywords
This publication has 101 references indexed in Scilit:
- Separation algorithms for 0-1 knapsack polytopesMathematical Programming, 2010
- Branching in branch-and-price: a generic schemeMathematical Programming, 2010
- Bidimensional packing by bilinear programmingMathematical Programming, 2007
- Comparison of bundle and classical column generationMathematical Programming, 2006
- Fast lifting procedures for the bin packing problemDiscrete Optimization, 2005
- Computational study of a column generation algorithm for bin packing and cutting stock problemsMathematical Programming, 1999
- A new heuristic algorithm for the one-dimensional bin-packing problemProduction Planning & Control, 1999
- A tight lower bound for optimal bin packingOperations Research Letters, 1995
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problemsOR Spectrum, 1988