Solving the variable size bin packing problem with discretized formulations
- 30 June 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (6) , 2103-2113
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problemComputers & Operations Research, 2008
- Accelerating column generation for variable sized bin-packing problemsEuropean Journal of Operational Research, 2007
- On the capacitated concentrator location problem: a reformulation by discretizationComputers & Operations Research, 2006
- The two-dimensional bin packing problem with variable bin sizes and costsDiscrete Optimization, 2005
- Algorithms for the variable sized bin packing problemEuropean Journal of Operational Research, 2003
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengthsEuropean Journal of Operational Research, 2002
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree ProblemOperations Research, 1995
- A comparison of heuristics and relaxations for the capacitated plant location problemEuropean Journal of Operational Research, 1991
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- Variable Sized Bin PackingSIAM Journal on Computing, 1986