Fast lifting procedures for the bin packing problem

Discrete Optimization

Volumn 2, Issue 3, 2005, Pages 201-218

  Haouari, Mohamed ^a   Gharbi, Anis ^a,b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b Inst Sup d'Informatique   (Tunisia)

Author keywords

Bin packing; Dual feasible functions; Lower bounds

Indexed keywords

PACKING; PROBLEM SOLVING;

BIN PACKING PROBLEM; LIFTING PROCEDURES;

OPTIMIZATION;

EID: 27144494969     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.06.002     Document Type: Article

References (16)

1. A. Alvim, F. Glover, C. Ribeiro, D. Aloise, A hybrid improvement heuristic for the bin packing problem, Proceedings of MIC 2001 - 4th Metaheuristics International Conference, 2001, pp. 63-68.
2. B. Chen, and B. Srivastava An improved lower bound for the bin packing problem Discrete Appl. Math. 66 1996 81 94
3. E.G. Coffman Jr., M.R. Gary, and D.S. Johnson Approximation algorithms for bin packing: a survey D. Hochbaum Approximation Algorithms for NP-Hard Problems 1997 PWS Publishing Boston
4. M. Dell'Amico, and S. Martello Optimal scheduling of tasks on identical parallel processors ORSA J. Comput. 7 1995 191 200
5. S. Elhedhli Ranking lower bounds for the bin packing problem European J. Oper. Res. 160 2005 34 46
6. S. Elhedhli, J.L. Goffin, The integration of an interior-point cutting plane method within a branch-and-price algorithm, Talk presented at the International Symposium on Mathematical Programming, Copenhagen, 2003.
7. E. Falkenauer A hybrid grouping genetic algorithm for bin packing J. Heuristics 2 1996 5 30
8. S. Fekete, and J. Schepers New classes of fast lower bounds for bin packing problems Math. Programming 91 2001 11 31
9. K. Fleszar, and K.S. Hindi New heuristics for one-dimensional bin-packing Comput. Oper. Res. 29 2002 821 839
10. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman San Francisco
11. M. Haouari, and A. Gharbi Lower bounds for scheduling on identical parallel machines with heads and tails Ann. Oper. Res. 129 2004 187 204
12. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementations 1990 Wiley Chichester
13. A. Scholl, R. Klein, and C. Jürgens BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem Comput. Oper. Res. 24 1997 627 645
14. J.M. Valério de Carvalho Exact solution of bin-packing problems using column generation and branch-and-bound Ann. Oper. Res. 86 1999 629 659
15. P.H. Vance, Crew scheduling, cutting stock, and column generation: solving huge integer programs, Ph.D. Dissertation in Industrial and Systems Engineering, Georgia Institute of Technology, 1993.
16. F. Vanderbeck Computational study of a column generation algorithm for bin-packing and cutting stock problems Math. Programming A 86 1999 565 594