A branch-and-price algorithm for the two-dimensional level strip packing problem
From MaRDI portal
Publication:1029564
DOI10.1007/S10288-007-0051-7zbMath1168.90577OpenAlexW2032180390MaRDI QIDQ1029564
Giovanni Righini, Andrea Bettinelli, Alberto Ceselli
Publication date: 13 July 2009
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-007-0051-7
Related Items (5)
Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ An optimization algorithm for a penalized knapsack problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances on two-dimensional bin packing problems
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- Two exact algorithms for the capacitated \(p\)-median problem
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- An optimization algorithm for a penalized knapsack problem
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- An Exact Approach to the Strip-Packing Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Column Generation
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
This page was built for publication: A branch-and-price algorithm for the two-dimensional level strip packing problem
