Prospective Network Flow Models and Algorithms for Bin Packing Problems
From MaRDI portal
Publication:2883549
DOI10.1016/j.endm.2010.05.007zbMath1237.90208MaRDI QIDQ2883549
Hélène Toussaint, Alain Quilliot
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.007
Cites Work
- Recent advances on two-dimensional bin packing problems
- 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
- A new constraint programming approach for the orthogonal packing problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Bidimensional Packing by Bilinear Programming
- Unnamed Item
- Unnamed Item