ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software - Practice and Experience

Volumn 30, Issue 11, 2000, Pages 1325-1352

  Jünger, Michael ^a   Thienel, Stefan ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b Sd M Software Des Mgmt GmbH Co KG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OBJECT ORIENTED PROGRAMMING; OPTIMIZATION;

BRANCH AND CUT; BRANCH AND PRICE; COMBINATORIAL OPTIMIZATION; OBJECT ORIENTED DESIGN;

COMPUTER SOFTWARE;

EID: 0342571667     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T     Document Type: Article

References (83)

1. Dantzig GB. Linear Programming and Extensions. Princeton University Press: Princeton, 1963.
2. Balinski ML. Mathematical programming: Journal, society, recollections. History of Mathematical Programming, Lenstra JK, Rinnooy Kan AHG, Schrijver A (eds.). CWI North-Holland, 1991; 5-18.
3. Charnes A, Cooper WW, Mellon B. Blending aviation gasoline - a study of programming interdependent activities in an integrated oil company. Econometrica 1952; 20.
4. Gomory RA. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 1958; 64:275-278.
5. Balas E, Ceria S, Cornuéjols G, Natraj NR. Gomory cuts revisited. OR Letters 1996; 19:1-10.
6. Land AH, Doig AG. An automatic method for solving discrete programming problems. Econometrica 1960; 28:493-520.
7. Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 1956; 7:48-50.
8. Dijkstra EW. A note on two problems in connection with graphs. Numerische Mathematik 1959; 1:269-271.
9. Edmonds J. Paths, trees and flowers. Canadian Journal of Mathematics 1965; 17:449-467.
10. Dantzig GB, Fulkerson DR, Johnson SM. Solution of a large scale traveling salesman problem. Operations Research 1954; 2:393-410.
11. Grötschel M, Jünger M, Reinelt G. A cutting plane algorithm for the linear ordering problem. Operations Research 1984; 32:1195-1220.
12. Karp RM, Papadimitriou CH. On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 1982; 11:620-632.
13. Christof T. Low-dimensional 0/1-polytopes and branch-and-cut in combinatorial optimization. PhD Thesis, Universität Heidelberg, 1997.
14. Padberg MW, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 1991; 33:60-100.
15. Jünger J, Reinelt G, Rinaldi G. The traveling salesman problem. Network Models (Handbook on Operations Research and Management Sciences, vol. 7), Ball M, Magnanti T, Monmai CL, Nemhauser GL (eds.). North-Holland: Amsterdam, 1995; 225-330.
16. Jünger M, Reinelt G, Thienel S. Practical problem solving with cutting plane algorithms in combinatorial optimization. Combinatorial Optimization (DIMACS Series in Discrete Mathematics and Theoretical Computer Science), Cook W, Lovász L, Seymour P (eds.). American Mathematical Society, 1995; 111-152.
17. Caprara A, Fischetti M. Branch-and-cut algorithms. Annotated Bibliographies in Combinatorial Optimization, Dell'Amico M, Maffioli F, Martello S (eds.). Wiley, 1997; 45-64.
18. Gilmore PC, Gomory RA. A linear programming approach to the cutting stock problem. Operations Research 1961; 9:849-859.
19. IBM Corporation. IBM Mathematical Programming System Extended/370 (MPSX/370), Mixed Integer Programming/370 (MIP/370), 1979.
20. Murtagh BA, Saunders M. Minos 5.4 user's guide. Technical Report, Stanford University, Department of Operations Research, 1995.
21. LINDO SYSTEMS Inc., LINDO user's manual, 1997.
22. Marsten R. The design of the XMP linear programming library. ACM Transations of Mathematical Software 1981; 7:481-497.
23. IBM Corporation, Optimization Subroutine Library - Guide and Reference, Release 2.1, 1995.
24. Cplex. Using the Cplex Callable Library. Cplex Optimization, Inc, 1997.
25. Dash Associates. XPRESS-MP, Optimisation Subroutine Library, 1995.
26. Suhl UH. MOPS - Mathematical OPtimization System, software tools for mathematical programming. European Journal of Operational Research 1994; 72:312-322.
27. Nemhauser GL, Savelsbergh MWP. Functional description of MINTO, a Mixed INTeger Optimizer, version 2.3. Technical Report, Georgia Institute of Technology, School of Industrial and Systems Engineering, 1996.
28. Sommerville I. Software Engineering. Addison-Wesley: Reading, MA, 1992.
29. Booch G. Object-Oriented Analysis and Design with Applications. The Benjamin Cummings Publishing Company: Redwood City, CA, 1994.
30. Stroustrup B. The C++ Programming Language (2nd edn). Addison-Wesley: Reading, MA, 1993.
31. Thienel S. ABACUS - A Branch-And-CUt system. PhD Thesis, Institut für Informatik, Universität zu Köln, 1995.
32. Jünger M, Thienel S. The design of the branch-and-cut system ABACUS. Technical Report, Institut für Informatik, Universität zu Köln, 1997.
33. Jünger M, Thienel S. Introduction to ABACUS - A Branch-And-CUt System. Operations Research Letters 1998; 22:83-95.
34. Thienel S. A simple TSP-solver. Technical Report, Institut für Informatik, Universität zu Köln, http://www.informatik.uni-koeln.de/ls_juenger/projects/abacus/abacus_tutorial. ps.gz, 1996.
35. Thienel S. ABACUS 2.0: User's Guide and Reference Manual. Institut für Informatik, Universität zu Köln, 1997. http://www.informatik.uni-koeln.de/ls_juenger/projects/abacus/manual.ps.gz.
36. Meyer B. Reusable Software, The Base Object-Oriented Component Libraries. Prentice-Hall: Hertfordshire, 1994.
37. Johnson RE, Foote B. Designing reusable classes. Journal of Object-Oriented Programming 1988; 1:22-35.
38. Thienel S. ABACUS 1.2: User's guide and reference manual. Technical Report, Institut für Informatik, Universität zu Köln, 1996.
39. Thienel S. A simple TSP-solver. Technical Report, Institut für Informatik, Universität zu Köln, http://www.informatik.uni-koeln.de/ls_juenger/projects/abacus/abacus_tutorial. ps.gz, 1996.
40. INFORMATION PROCESSING SYSTEM Accredited Standards Committee, X3. The ISO/ANSI C++ Draft, 1995. http://www.cygnus.com/misc/wp/.
41. Mehlhorn K, Näher S, Uhrig C. The LEDA User Manual Version R 3.4.1. Max-Planck-Institut für Informatik, Saarbrücken, 1996.
42. Gorlen KE, Orlow SM, Plexico PS. Data Abstraction and Object-Oriented Programming in C++. John Wiley, 1990.
43. Lee M, Musser D, Stepanow A. The standard template library. Technical Report, Rensselaer Polytechnic Institute, 1995. http://www.cs.rpi.edu/~musser/stl.html.
44. Jünger M, Kaibel V. On the SQAP polytope. Technical Report, Institut für Informatik, Universität zu Köln, 1996. To appear in SIAM Journal of Optimization.
45. Vance PH, Barnhart C, Johnson EJ, Nemhauser GL. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 1994; 3:111-130.
46. Balas E, Ceria S, Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 1993; 58:295-324.
47. Schrijver A. Polyhedral combinatorics (Handbook of Combinatorics, vol. 2), Graham R, Grötschel M, Lovász L (eds.). Elsevier, 1995; 1649-1704.
48. Chvátal V. Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming 1973; 5:29-40.
49. Padberg MW, Ram Rao M. Odd minimum cut sets and b-matchings. Mathematics of Operations Research 1982; 7:67-80.
50. Jünger M, Reinelt G, Thienel S. Provably good solutions for the traveling salesman problem. Zeitschrift für Operations Research 1994; 40:183-217.
51. Reinelt G. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 1991; 3:376-384.
52. Naddef D, Thienel S. Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Technical Report, Institut für Informatik, Universität zu Köln, 1999, to appear.
53. Naddef D, Thienel S. Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Technical Report, Institut für Informatik, Universität zu Köln, 1999, to appear.
54. Balas E, Ceria S, Cornuéjols G. Solving mixed 0-1 programs by a lift-and-project method. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993; 232-242.
55. Hoffman K, Padberg MW. Solving airline crew scheduling problems by branch-and-cut. Management Science 1993; 39:657-682.
56. Wunderling R. SoPlex, The Sequential object-oriented simplex class library, 1997. http://www.zib.de/Optimization/Software/Soplex/.
57. Savelsbergh MWP. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing 1994; 6:445-454.
58. Clochard JM, Naddef D. Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem. Proceedings on the Third IPCO Conference, Wolsey L, Rinaldi G (eds.). 1993; 291-311.
59. Ryan DM, Foster BA. An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, Wren A (ed.). North-Holland: Amsterdam, 1981; 269-280.
60. Berkelaar MRCM. lp_solve 2.0, 1995. ftp://ftp.es.ele.tue.nl/pub/lp_solve.
61. Saltzman MJ. Broad selection of software packages available OR/MS Today 1994; 42-51.
62. Nemhauser GL, Savelsbergh MWP, Sigismondi GC. MINTO, a Mixed INTeger Optimizer. Operations Research letters 1994; 15:47-58.
63. Engel F. Branching algorithms for crew scheduling problems. Master's Thesis, Chalmers University, 1997.
64. Mutzel P, Ziegler T. The constrained crossing minimization problem - a first approach. Operations Research Proceedings 1998. Springer, 1999; 125-134.
65. Gritzmann P, Prangenberg D, de Vries S, Wiegelmann M. Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Technical Report, Technische Universität München, 1997.
66. Funke M, Reinelt G. A polyhedral approach to the feedback vertex set. Integer Programming and Combinatorial Optimization (Proceedings of the 5th International IPCO Conference, Vancouver, Canada, June 1996) (Lecture Notes in Computer Science, vol. 1084), Cunningham WH, McCormick ST, Queyranne M (eds.). Springer Verlag, 1996; 445-459.
67. Kupke J. Ein Branch-and-Price Algorithmus für das ganzzahlige Verschnittproblem. Master's Thesis, Institut für Informatik, Universität zu Köln, 1998.
68. Christof T, Reinelt G. Combinatorial optimization and small polytopes. TOP (Spanish Statistical and Operations Research Society) 1996; 4:1-64.
69. Jünger M, Rinaldi G. Relaxations of the max cut problem and computation of spin glass ground states. Operations Research Proceedings, Kischka P et al. (eds.). Springer: Heidelberg, 1997; 74-83.
70. Jünger M, Lee EK, Mutzel P, Odenthal T. A polyhedral approach to the multi-layer crossing minimization problem. Proceedings of Graph Drawing '97 (Lecture Notes in Computer Science, vol. 1353), di Battista G (ed.). Springer: Heidelberg, 1997; 13-24.
71. Reinert K. Lenhof H-P, Mutzel P, Mehlhorn K, Kececioglou JD. A branch-and-cut algorithm for multiple sequence alignment. First Annual International Conference on Computational Molecular Biology. ACM, 1997.
72. Christof T, Jünger M, Kececioglu J, Mutzel P, Reinelt G. A branch-and-cut approach to physical mapping of chromosomes by using end-probes. Journal Computational Biology 1997; 4:433-447.
73. Pesch N. Das pickup-and-delivery problem - betrachtet als modifiziertes traveling-salesman-problem. Master's Thesis, Institut für Informatik, Universität zu Köln, 1998.
74. Fialko S. Das Planare Augmentierungsproblem. Master's Thesis, Universität des Saarlandes, Saarbrücken, 1997.
75. Fortz B. Design of survivable networks with bounded rings. PhD Thesis, Service de Mathématiques de la Gestion, Université Libre de Bruxelles, 1998.
76. Kaibel V. Polyhedral combinatorics of QAPs with less objects than locations. Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization. Springer, 1998; 409-422.
77. Lenhof H-P, Reinert K, Vingron V. A polyhedral approach to RNA sequence structure alignment. Proceedings of the Second Annual International Conference on Computational Molecular Biology RECOMB, 1998.
78. Verweij B, Aardal K, Kant G. On an integer multicommodity flow problem from the airplane industry. Technical Report UU-CS-1997-38, Department of Computer Science, Utrecht University, Utrecht, 1997.
79. Mutzel P. An alternative method for crossing minimization on hierarchical graphs. Proceedings of the Graph Drawing '96 (Lecture Notes in Computer Science, vol. 1190), North S (ed.). Springer Verlag, 1997; 318-333.
80. Mutzel P, Weiskircher R. Two layer planarization in graph drawing. Proceedings of the ISAAC '98 (Lecture Notes in Computer Science, vol. 1533), Chwa KY, Ibarra OH (eds.). Springer Verlag, 1998; 69-78.
81. Klau G, Mutzel P. Optimal compaction of orthogonal grid drawings Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization IPCO'99, 1999.
82. Esparza J, Melzer S. Verification of safety properties using integer programming: Beyond the state equation. Technical Report, Technische Universität München, 1997.
83. Christof T, Oswald M, Reinelt G. Consecutive ones and a betweenness problem in computational biology. Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO98), 1998.