A new lower bound for the non-oriented two-dimensional bin-packing problem
From MaRDI portal
Publication:2467479
DOI10.1016/J.ORL.2006.07.001zbMATH Open1169.90431OpenAlexW2012063702MaRDI QIDQ2467479FDOQ2467479
François Clautiaux, Joseph El Hayek, Antoine Jouglet
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
Cites Work
- An improved typology of cutting and packing problems
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- 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
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Bidimensional Packing by Bilinear Programming
Cited In (10)
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A hybrid algorithm for constrained order packing
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Sequential heuristic for the two-dimensional bin-packing problem
This page was built for publication: A new lower bound for the non-oriented two-dimensional bin-packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467479)
