New Classes of Lower Bounds for Bin Packing Problems
- 18 June 1998
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 257-270
- https://doi.org/10.1007/3-540-69346-7_20
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A new exact algorithm for general orthogonal d-dimensional knapsack problemsLecture Notes in Computer Science, 1997
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Bin packing with items uniformly distributed over intervals [a,b]Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981