Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2241, Issue , 2001, Pages 157-222

  Elf, Matthias ^a   Gutwenger, Carsten ^b   Jünger, Michael ^a   Rinaldi, Giovanni ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b CENTER OF ADVANCED EUROPEAN STUDIES AND RESEARCH CAESAR   (Germany)

^c CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; MATHEMATICAL INSTRUMENTS; MOBILE AGENTS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

BRANCH AND CUT AND PRICES; BRANCH-AND-CUT ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL ASPECTS; DESIGN AND APPLICATION; MAXIMUM CUT PROBLEMS; MIXED INTEGER LINEAR PROGRAM; MIXED INTEGER LINEAR PROGRAMMING;

INTEGER PROGRAMMING;

EID: 84959053855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45586-8_5     Document Type: Conference Paper

References (69)

1. ABACUS 2.3: User’s guide and reference manual. Oreas GmbH, 1999.
2. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: TSP-solver “Concorde”. at http://www.keck.caam.rice.edu/concorde.html, 1999.
3. Applegate, D., Cook, W.: Solving large-scale matching problems. Network Flows and Matching, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, Johnson, D.S., McGeoch, C.C., eds., pp. 557–576, 1993.
4. Balas, E., Ceria, S., Cornuéjols, G., Natraj, N.R.: Gomory cuts revisited. Operations Research Letters 19, 1–10, 1996.
5. Balas, E., Toth, P.: Branch and bound methods, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The traveling salesman Problem. John Wiley & Sons, Chichester, 361–401, 1985.
6. Balinski, M. L.: Mathematical Programming: Journal, Society, Recollections. in: Lenstra et al. (eds.) History of mathematical programming, CWI North-Holland, 5–18, 1991.
7. Barahona, F.: The max-cut problem on graphs not contractible to K5. Operations Research Letters 2, 107–111, 1983.
8. Barahona, F.: On cuts and matchings in planar graphs. Mathematical Programming 70, 53–68, 1993.
9. Barahona, F., Grötschel, M., Jünger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 493–513, 1988.
10. Barahona, F., Mahjoub, A.R.: On the cut polytope. Mathematical Programming 36, 157–173, 1986.
11. Boros, E., Hammer, P.L. Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions. Mathematics of Operations Research 18, 245–253, 1993.
12. Caprara, A., Fischetti, M.: Branch-and-cut algorithms. in: Dell’Amico, M. et al. (eds.), Annotated bibliographies in combinatorial optimization, Wiley, 45–64, 1997.
13. Charnes, A., Cooper, W.W., Mellon, B.: Blending aviation gasoline–A study of programming interdependent activities in an integrated oil company. Econometrica 20, 1952.
14. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581, 1964.
15. Christof, T., Reinelt, G.: Algorithmic aspects of using small instance relaxations in parallel branch and cut. Technical Report, to appear in Algorithmica, 2001.
16. Christof, T.: Low-Dimensional 0/1-Polytopes and Branch-and-Cut in Combinatorial Optimization. Doctoral Thesis, Universität Heidelberg, 1997.
17. Cplex 6.6, Using the Cplex callable library and mixed integer library. Cplex Optimization Inc., 2000.
18. Clochard, J.M., Naddef, D.: Using path inequalities in an branch and cut code for the symmetric traveling salesman problem. in: G. Rinaldi and L. Wolsey (eds.), Proceedings of the Third IPCO Conference, 291–311, 1993.
19. Cordier, C., Marchand, H., Laundy, R., Wolsey, L.A.: bc-opt: a branch-andcut code for mixed integer programs. Discussion Paper CORE-9778, Université Catholique de Louvain, 1997.
20. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, 1963.
21. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large scale traveling salesman problem. Operations Research 2, 393–410, 1954.
22. Dantzig, G.B., Wolfe, P.: The Decomposition Algorithm for Linear Programs. Econometrica, 29:767–778, 1961.
23. Deza, M., Laurent, M.: Cut Polyhedra and Metrics. LIENS-Ecole Normale Supérieure, 1996.
24. De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optimization Methods and Software 3, 195–214, 1994.
25. De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states in spin glasses: New experimental results with a branchand-cut algorithm. Journal of Statistical Physics 80, 487–496, 1995.
26. De Simone, C., Diehl, M., Jünger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of 2-dimensional ± J Ising spin glasses. Journal of Statistical Physics 84, 1363–1371, 1996.
27. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271, 1959.
28. Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449–467, 1965.
29. Elf, M., Jünger, M., Rinaldi, G.: Minimizing Breaks by Maximizing Cuts. Technical Report (zpr2001-409), Universität zu Köln, 2001
30. Felici, G., Gentile, C., Rinaldi, G.: Solving Large MIP Models in Supply Chain Management by Branch & Cut. IASI-CNR Research Report n. 522, 2000.
31. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859, 1961.
32. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64, 275–278, 1958.
33. Gomory, R.E., Hu, T.C.: Multiterminal network flows. SIAM Journal 9, 551–570, 1961.
34. Grötschel, M., Jünger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Operations Research 32, 1195–1220, 1984.
35. Grötschel, M., Martin, A., Weismantel, R.: Packing Steiner trees: A cutting plane algorithm and computational results. Mathematical Programming 72, 125-145, 1996.
36. Grötschel, M., Holland, O.: Solving matching problems with linear Programming. Mathematical Programming 33, 243–259, 1985
37. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 4, 169–197, 1981.
38. Henz, M.: Scheduling a major college basketball conference—revisited. Technical Note, School of Computing, National University of Singap ore, 1999
39. Jünger, M., Reinelt, G., Rinaldi, G.: The Traveling Salesman Problem. in: Ball, M. et al. (eds.) Network Models, Handbook on operations research and management sciences, Vol. 7, North Holland, Amsterdam, pp. 225–330, 1995.
40. Jünger, M., Reinelt, G., Rinaldi, G.: Lifting and separation procedures for the cut polytope. Technical Report, Universität zu Köln, in preparation.
41. Jünger, M., Reinelt, G., Thienel, S.: Practical problem solving with cutting plane algorithms in combinatorial optimization. in: Cook, W. et al. (eds.) Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 111–152, 1995.
42. Jünger, G., Rinaldi, G., Thienel, S.: Practical performance of efficient minimum cut algorithms. Algorithmica 26, 172–195, 2000.
43. Jünger, M., Reinelt, G., Thienel, S.: Provably good solutions for the traveling salesman problem. Zeitschrift für Operations Research 40, 183–217, 1994.
44. Jünger, M., Thienel, S.: The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization. Software Practice and Experience 30, 1325–1352, 2000.
45. Karp, R. M., Papadimitriou, C. H.: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11, 620–632, 1982.
46. Kruskal, J. B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48–50, 1956.
47. Land, A. H., Doig, A. G.: An automatic method for solving discrete programming problems. Econometrica 28, 493–520, 1960.
48. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516, 1973.
49. Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Mathematical Programming 58, 53–88, 1993.
50. Naddef, D., Thienel, S.: Efficient Separation Routines for the Symmetric Traveling Salesman–Problem I: General Tools and Comb Separation. Technical Report 99-376, Institut für Informatik, Universität zu Köln, 1999, to appear in Mathematical Programming.
51. Naddef, D., Thienel, S.: Efficient Separation Routines for the Symmetric Traveling Salesman–Problem II: Separating multi Handle Inequalities. Technical Report 99-377, Institut für Informatik, Universität zu Köln, 1999, to appear in Mathematical Programming.
52. Naddef, D.: The Traveling Salesman Problem and its Variations, Chapter 2, Gutin, G. and Punnen, A. (eds.), Kluwer Academic Press, to appear.
53. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed Integer Optimizer. Operations Research Letters 15, 47–58, 1994.
54. Nemhauser, G. L., Trick, M. A.: Scheduling a major college basketball conference. Operations Research 46, 1–8, 1998.
55. Padberg, M. W., Rinaldi, G.: Optimization of a 532 City Symmetric Traveling Salesman Problem by Branch and Cut. Operations Research Letters 6, 1–7, 1987.
56. Padberg, M. W., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33, 60–100, 1991.
57. Padberg, M.W., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming 47, 19–36, 1990.
58. Padberg, M.W., Rinaldi, G.: Facet Identification for the Symmetric Traveling Salesman Polytope. Mathematical Programming 47, 219–257, 1990.
59. Poljak, S., Tuza, Z.: The max-cut problem—A survey, Institute of Mathematics, Academia Sinica, 1994.
60. Reinelt, G., Fast heuristics for large geometric traveling salesman problems. ORSA Journal on Computing 4, 206-217, 1992.
61. Reinelt, G.: TSPLIB—A Traveling Salesman Problem Library. ORSA Journal On Computing 3, 376–384, 1991.
62. Régin, J.-C.: Minimization of the number of breaks in sports scheduling problems using constraint programming. Talk presented at DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, Sep. 14–19, 1998.
63. Régin, J.-C.: Modelling with constraint programming. Talk presented at Dagstuhl Seminar on Constraint Programming and Integer Programming, Jan. 17–21, 2000.
64. Thienel, S.: ABACUS–A Branch And CUt System. Doctoral Thesis, Universit ät zu Köln, 1995.
65. Thienel, S.: A Simple TSP-Solver: An ABACUS Tutorial. Technical Report 96.245, Universität zu Köln, 1996.
66. Schreuder, J. A. M.: Combinatorial aspects of construction of competition Dutch Professional Football Leagues. Discrete Applied Mathematics 35, 301–312, 1992.
67. Trick, M. A.: A schedule-then-break approach to sports timetabling. Proceedings of PATAT 2000, to appear.
68. 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, 111-130, 1994.
69. XPRESS 12, Reference Manual: XPRESS-MP Optimizer Subroutine Library XOSL, Dash Associates, 2000.