An analysis of lower bound procedures for the bin packing problem
Authors:
- Jean-Marie BourjollyJBJean-Marie Bourjolly
- Vianney RebetezVRVianney Rebetez
- 1 March 2005
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 32 (3) , 395-405
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Optimal Scheduling of Tasks on Identical Parallel ProcessorsINFORMS Journal on Computing, 1995
- Branch-and-bound algorithms for the multi-product assembly line balancing problemEuropean Journal of Operational Research, 1992
- Capacitated Vehicle Routing on TreesOperations Research, 1991
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- Approximation Algorithms for Bin-Packing — An Updated Survey1984
- Assembly line balancing as generalized bin packingOperations Research Letters, 1982
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- The Loading ProblemManagement Science, 1971