Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

European Journal of Operational Research

Volumn 170, Issue 2, 2006, Pages 416-439

  Peeters, Marc ^a   Degraeve, Zeger ^b  

^a Electrabel   (Belgium)

^b LONDON BUSINESS SCHOOL   (United Kingdom)

Author keywords

Branch and price; Integer programming; Packing

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; PACKING; PROBLEM SOLVING;

BRANCH-AND-PRICE; COMPUTATIONAL TESTS; DUAL BIN PACKING; HEURISTICS;

ALGORITHMS;

EID: 26844582095     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.06.034     Document Type: Article

References (27)

1. J.L. Bruno, and P.J. Downey Probabilistic bounds for dual bin packing Acta Informatica 22 1985 333 345
2. V. Chvátal Linear Programming 1983 W.H. Freeman and Co New York
3. E.G. Coffman Jr., J.Y.-T. Leung, and D.W. Ting Bin packing: Maximizing the number of pieces packed Acta Informatica 9 1978 263 271
4. Z. Degraeve, L. Schrage, Should we use a portable generator in an emergency? Research Report, Department of Applied Economic Sciences, K.U. Leuven, Belgium, 1997.
5. Z. Degraeve, and L. Schrage Optimal integer solutions to industrial cutting stock problems INFORMS Journal on Computing 11 1999 406 419
6. Z. Degraeve, M. Peeters, Solving the linear programming relaxation of cutting and packing problems: A hybrid simplex method/subgradient optimization procedure, OR0017, Departement Toegepaste Economische Wetenschappen, K.U. Leuven, 2000.
7. Z. Degraeve, and M. Peeters Optimal integer solutions to industrial cutting stock problems, Part 2: Benchmark results INFORMS Journal on Computing 15 2003 58 81
8. J. Desrosiers, and F. Soumis A column generation approach to the urban transit crew scheduling problem Transportation Science 23 1989 1 12
9. J. Desrosiers, F. Soumis, and M. Desrochers Routing with time windows by column generation Networks 14 1984 545 565
10. J. Dongarra, Performance of various computers using standard linear equations software, Computer Science Technical Report, CS-89-85, Computer Science Department, University of Tennessee, 2003.
11. A.M. Geoffrion Lagragian relaxation for integer programming Mathematical Programming Study 2 1974 82 114
12. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock-problem Operations Research 9 1961 849 859
13. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock problem-Part II Operations Research 11 1963 863 888
14. M.P. Johnson, C. Rennick, and E. Zak Skiving addition to the cutting stock problem in the paper industry SIAM Review 39 1997 472 483
15. M. Labbé, G. Laporte, and S. Martello An exact algorithm for the dual bin packing problem Operations Research Letters 17 1995 9 18
16. M. Labbé, G. Laporte, S. Martello, Upper bounds and algorithms for the maximum cardinality bin packing problem, Les Cahiers du GERAD, G-97-05, 1997.
17. S. Martello, D. Pisinger, and P. Toth Dynamic programming and strong bounds for the 0-1 knapsack problem Management Science 45 1999 414 423
18. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementations Wiley Interscience Series in Discrete Mathematics and Optimization 1990 John Wiley & Sons Chichester, UK
19. M. Peeters, Cutting and packing: New problems and algorithms, PhD thesis, Departement of Applied Economics, K.U. Leuven, 2002.
20. D. Pisinger, and P. Toth D.-Z. Du P. Pardalos Knapsack Problems Handbook of Combinatorial Optimization 1 1998 Kluwer Academic Publishers Boston, MA 299 428
21. W.T. Rhee, and M. Talagrand Dual bin packing with items of random sizes Mathematical Programming 58 1993 229 242
22. M. Savelsbergh A branch-and-price algorithm for the generalized assignment problem Operations Research 45 1997 831 841
23. L. Schrage Lindo: Optimization Software for Linear Programming 1995 Lindo Systems Inc. Chicago, IL
24. P.H. Vance Branch-and-price algorithms for the one-dimensional cutting stock problem Computational Optimization and Applications 9 1998 212 228
25. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming 86 Series A 1999 565 594
26. F. Vanderbeck, and L.A. Wolsey An exact algorithm for IP column generation Operations Research Letters 19 1996 151 159
27. G. Wäscher, and T. Gau Heuristics for the integer one-dimensional cutting stock problem: A computational study OR Spektrum 18 1996 131 144