Computational study of a column generation algorithm for bin packing and cutting stock problems

Mathematical Programming, Series B

Volumn 86, Issue 3, 1999, Pages 565-594

  Vanderbeck, François ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Bin packing; Column generation; Cutting stock; Integer programming

Indexed keywords

EID: 0000906834     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050105     Document Type: Article

References (28)

1. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H. (1994): Branch-and-Price: Column Generation for Solving Huge Integer Programs. In: Birge, J.R., Murty, K.G., eds., Mathematical Programming, State of the Art. Book of the International Symposium on Mathematical Programming
2. Beasley, J.E. (1990): OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069-1072
3. CPLEX (1994): Using the CPLEX Linear Optimizer, version 3.0. CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg. 802, Incline Village, NV 89451-9436. (702) 831-7744
4. Degraeve, Z., Schrage, L. (1997): Optimal Integer Solutions to Industrial Cutting Stock Problems. To appear in INFORMS J. Comput.
5. Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M.M., Soumis, F. (1994): A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. Les Cahiers du GERAD, G-94-46
6. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F. (1994): Time Constrained Routing and Scheduling, In: Ball, M.E., Magnanti, T.L., Monma, C., Nemhauser, G.L., eds., Handbooks in Operations Research and Management Sciences: Networks, Chapter 2. North-Holland
7. Desrosiers, J., Soumis, F. (1996): Cuts for the Vehicle Routing Problem. Private communication
8. Eppen, G.D., Martin, R.K. (1987): Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Oper. Res. 35, 832-848
9. Farley, A.A. (1990): A note on bounding a class of linear programming problems, including cutting stock problems. Oper. Res. 38, 922-923
10. Gilmore, P.C., Gomory, R.E. (1961): A Linear Programming Approach to the Cutting Stock Problem. Oper. Res. 9, 849-859
11. Gilmore, P.C., Gomory, R.E. (1963): A Linear Programming Approach to the Cutting Stock Problem: Part II. Oper. Res. 11, 863-888
12. Goulimis, C.N. (1988): The cutting stock problem revisited. Ph.D. thesis, Dept. of Electrical Engineering, Imperial College, London SW7
13. Goulimis, C.N. (1990): Optimal Solutions for the Cutting Stock Problem. Eur. J. Oper. Res. 44, 197-208
14. Johnson, E.L., Padberg, M.W. (1981): A Note on the Knapsack Problem With Special Ordered Sets. Oper. Res. Lett. 1, 18-22
15. Marcotte, O. (1985): The Cutting Stock Problem and Integer Rounding. Math. Program. 33, 89-92
16. Marcotte, O. (1986): An Instance of the Cutting Stock Problem for which the Rounding Property Does Not Hold. Oper. Res. Lett. 4, 239-243
17. Martello, S., Toth, P. (1990): Knapsack Problems: Algorithms and computer Implementations. Wiley-Interscience Series in Discrete Mathematics and Optimization
18. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. John Wiley & Sons
19. Scheithauer, G., Terno, J. (1995): A Branch-and-Bound Algorithm for Solving One-dimensional Cutting Stock Problems Exactly. Appl. Math. 23, 151-167
20. Scholl, A., Klein, R., Jurgens, C. (1997): Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24, 667-645
21. Sutter, A., Vanderbeck, F., Wolsey, L.A. (1998): Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46(5), 719-728
22. Valerio de Carvalho, J.M. (1996): Exact Solution of bin-packing problems using column generation and branch-and-bound. Working paper. Depart. Prouducao e Sistemas, Universidade do Minho, 4709 Braga Codex, Portugal
23. Vance, P.H., Banhard, C., Johnson, E.L., Nemhauser, G.L. (1994): Solving Binary Cutting Stock Problems by Column Generation and Branch-and-bound. Comput. Optim. Appl. 3, 111-130
24. Vance, P.H. (1996): Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem. Working paper. Department of Industrial Engineering, Auburn University, Auburn, Alabama 36849-5346. To appear in Comput. Optim. Appl.
25. Vanderbeck, F. (1994): Decomposition and Column Generation for Integer Programs. Ph.D. Thesis, Faculté des Sciences Appliqées, Université Catholique de Louvain, Louvain-la-Neuve
26. Vanderbeck, F., Wolsey, L.A. (1996): An Exact Algorithm for IP Column Generation. Oper. Res. Lett. 19, 151-159
27. Vanderbeck, F. (1996): On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Research Papers in Management Studies 29, University of Cambridge, 1994-1995 (revised in 1996). To appear in Oper. Res.
28. Vanderbeck, F. (1998): Extending Dantzig's Bound to the Bounded Multiple-class Knapsack Problem. Research Papers in Management Studies 14, University of Cambridge