A branch-and-price algorithm for the two-dimensional level strip packing problem
- 19 September 2007
- journal article
- Published by Springer Nature in 4OR
- Vol. 6 (4) , 361-374
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An optimization algorithm for a penalized knapsack problemOperations Research Letters, 2006
- A General Framework for Bounds for Higher-Dimensional Orthogonal Packing ProblemsMathematical Methods of Operations Research, 2004
- Models and Bounds for Two-Dimensional Level Packing ProblemsJournal of Combinatorial Optimization, 2004
- A Combinatorial Characterization of Higher-Dimensional Orthogonal PackingMathematics of Operations Research, 2004
- An Exact Approach to the Strip-Packing ProblemINFORMS Journal on Computing, 2003
- Recent advances on two-dimensional bin packing problemsDiscrete Applied Mathematics, 2002
- Two-dimensional packing problems: A surveyEuropean Journal of Operational Research, 2002
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock ProblemMathematics of Operations Research, 2000
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack ProblemManagement Science, 1999
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987