Exact solution of bin-packing problems using column generation and branch-and-bound

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 629-659

  Valerio De Carvalho J M ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Bin packing; Branch and bound; Column generation

Indexed keywords

EID: 0042094654     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018952112615     Document Type: Article

References (24)

1. R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. J.E. Beasley, OR-library: Distributing test problems by electronic mail, Journal Operational Research Society 41(1990)1069-1072.
3. J.M. Valério de Carvalho, A model for the one-dimensional cutting-stock problem, Working Paper, 1996.
4. J. Desrosiers, Y. Dumas, M. M. Salomon and F. Soumis, Time constrained routing and scheduling, in: Handbooks in Operations Research & Management Science 8: Network Routing, Elsevier Science, 1995.
5. J. Desrosiers, F. Soumis and M. Desrochers, Routing with time windows by column generation, Networks 14(1984)545-565.
6. E.G. Coffman. Jr., M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing - an updated survey, in: Algorithm Design for Computer System Design, Springer, Berlin, 1984.
7. E.V. Denardo, Dynamic Programming Models and Applications, Prentice-Hall, NJ, 1982.
8. E. Falkenauer, A hybrid grouping genetic algorithm for bin packing, International Journal of Computers and Operations Research (1995), to appear.
9. M. Fieldhouse, The duality gap in trim problems, SICUP Bulletin 5 (November 1990).
10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
11. P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem -part ii, Operations Research 11(1963)863-888.
12. O. Marcotte, The cutting stock problem and integer rounding, Mathematical Programming 33(1985) 82-92.
13. O. Marcotte, An instance of the cutting stock problem for which the rounding property does not hold, Operations Research Letters 4(1986)239-243.
14. R.M. Marsten, The design of the XMP linear programming library, ACM Transactions on Mathematical Software 7(1981)481-497.
15. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
16. G. Nemhauser and S. Park, A polyhedral approach to edge coloring, Operations Research Letters 10(1991)315-322.
17. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
18. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
19. Salford, Salford Software, 1995.
20. J.F. Shapiro, Dynamic programming algorithms for the integer programming problem I: The integer programming problem viewed as a knapsack type problem, Operations Research 16(1968)103-121.
21. D. Simchi-Levi, New worst-case results for the bin-packing problem, Naval Research Logistics 41(1994)579-585.
22. P. Vance, C. Barnhart, E. L. Johnson and G. L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Computational Optimization and Applications 3 (1994)111-130.
23. F. Vanderbeck, On integer programming decomposition and ways to enforce integrality in the master, Research Papers in Management Studies, 1994-1995, No. 29 (revised May 1996), University of Cambridge, 1996.
24. F. Vanderbeck, Computational study of a column generation algorithm for binpacking and cutting stock problems, Research Papers in Management Studies, 1996, No. 14, University of Cambridge, 1996.