New lower bounds for bin packing problems with conflicts
Authors:
- Ali KhanaferAKAli Khanafer
- François ClautiauxFCFrançois Clautiaux
- El-Ghazali TalbiETEl-Ghazali Talbi
- 1 October 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 206 (2) , 281-288
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Exact algorithms for the two-dimensional strip packing problem with and without rotationsEuropean Journal of Operational Research, 2009
- Knapsack problems with setupsEuropean Journal of Operational Research, 2009
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generationEuropean Journal of Operational Research, 2008
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientationComputers & Operations Research, 2007
- Heuristics and lower bounds for the bin packing problem with conflictsComputers & Operations Research, 2004
- Two-dimensional packing problems: A surveyEuropean Journal of Operational Research, 2002
- Heuristics for the container loading problemEuropean Journal of Operational Research, 2002
- Packing problemsEuropean Journal of Operational Research, 1992
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987