A new lower bound for the non-oriented two-dimensional bin-packing problem
From MaRDI portal
Publication:2467479
DOI10.1016/j.orl.2006.07.001zbMath1169.90431MaRDI QIDQ2467479
Antoine Jouglet, François Clautiaux, Joseph El Hayek
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.07.001
90C27: Combinatorial optimization
Cites Work
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- A lower bound for the non-oriented two-dimensional bin packing problem
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Bidimensional Packing by Bilinear Programming
- Two-Dimensional Finite Bin-Packing Algorithms