Ranking lower bounds for the bin-packing problem

European Journal of Operational Research

Volumn 160, Issue 1, 2005, Pages 34-46

  Elhedhli, Samir ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Bin packing; Integer programming; Lagrangean relaxation

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; EVALUATION; LAGRANGE MULTIPLIERS; PACKING; PROBLEM SOLVING; RELAXATION PROCESSES;

BIN-PACKING; CAPACITY CONSTRAINTS; LAGRANGEAN RELAXATION;

INTEGER PROGRAMMING;

EID: 3943083398     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.06.019     Document Type: Conference Paper

References (14)

1. Coffman E.G., Garey M.R., Johnson D.S. Approximation algorithms for bin packing: A survey. Hochbaum D. Approximation Algorithms for NP-hard Problems. 1997;PWS Publishing Company. (Chapter 2).
2. Damodaran S., Sivalingam K.M. Scheduling algorithms for multiple channel wireless local area networks. Computer Communications. 25(14):2002;1305-1314.
3. Dantzig G.B., Wolfe P. Decomposition principle for linear programs. Operations Research. 8:1960;101-111.
4. Desaulniers G., Desrosiers J., loachim I., Salomon M., Soumis F., Villeneuve D. A unified framework for deterministic time constrained routing and crew scheduling problems. Crainic T.G., Laporte G. Fleet Management and Logistics. 1998;57-93 Kluwer Academic Publishers, Boston.
5. S. Elhedhli, J.-L. Goffin, The integration of an interior-point cutting plane method within a branch-and-price algorithm, Mathematical Programming A (forthcoming).
6. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science. 27:1981;1-18.
7. Geoffrion A.M. Lagrangean relaxation for integer programming. Mathematical Programming Study. 2:1974;82-114.
8. Lemarechal C. Lagrangian relaxation. Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions. Jünger, Naddef Lecture Notes in Computer Science. Vol. 224:2001;Springer.
9. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;John Wiley and Sons, New York.
10. Muyldermans L., Cattrysse L.M., Van Oudheusden D., Lotan T. Districting for salt spreading operations. European Journal of Operational Research. 139(3):2002;521-532.
11. Scholl A., Klein R., Jürgens C. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research. 24:1997;627-645.
12. Valerio de Carvalho M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research. 86:1999;626-659.
13. Vance P.H., Barnhart C., Johnson E.L., Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications. 3:1994;111-130.
14. Vanderbeck F. Computational study of a column generation algorithm for bin-packing and cutting stock problems. Mathematical Programming A. 86:1999;565-594.