Computational Integer Programming and Cutting Planes

Handbooks in Operations Research and Management Science

Volumn 12, Issue C, 2005, Pages 69-121

  Fügenschuh, Armin ^a   Martin, Alexander ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 53449093660     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)12002-7     Document Type: Review

References (114)

1. Aardal K., Pochet Y., and Wolsey L.A. Capacitated facility location: valid inequalities and facets. Mathematics of Operations Research 20 (1995) 562-582
2. Aardal K., Weismantel R., and Wolsey L.A. Non-standard approaches to integer programming. Discrete Applied Mathematics 123/124 (2002) 5-74
3. Achterberg T., Koch T., and Martin A. Branching Rules Revisited. Operation Research Letters 33 (2005) 42-54
4. Andersen E.D., and Andersen K.D. Presolving in linear programming. Mathematical Programming 71 (1995) 221-245
5. Applegate, D., R. E. Bixby, V. Chvátal, W. Cook (March, 1995). Finding cuts in the TSP. Technical Report 95-05, DIMACS
6. Atamtürk A. On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming 98 (2003) 145-175
7. Atamtürk A. Sequence independent lifting for mixed integer programming. Operations Research 52 (2004) 487-490
8. Atamtürk A. On capacitated network design cut-set polyhedral. Mathematical Programming 92 (2002) 425-437
9. Atamtürk A., Nemhauser G.L., and Savelsbergh M.W.P. Conflict graphs in integer programming. European Journal of Operations Research 121 (2000) 40-55
10. Balas E. Facets of the knapsack polytope. Mathematical Programming 8 (1975) 146-164
11. Balas E., Ceria S., and Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58 (1993) 295-324
12. Balas E., Ceria S., and Cornuéjols G. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science 42 (1996) 1229-1246
13. Balas E., Ceria S., Cornuéjols G., and Natraj N. Gomory cuts revisited. Operations Research Letters 19 (1996) 1-9
14. Balas E., Ceria S., Dawande M., Margot F., and Pataki G. OCTANE: a new heuristic for pure 0-1 programs. Operations Research 49 (2001) 207-225
15. Balas E., and Martin R. Pivot and complement: a heuristic for 0-1 programming. Management Science 26 (1980) 86-96
16. Balas E., and Zemel E. Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics 34 (1978) 119-148
17. Barahona, F., L. Ladanyi (2001). Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. Technical Report RC22221, IBM
18. Barahona F., and Ranga Anbil. The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming 87 3 (2000) 385-399
19. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: column generation for huge integer programs. Operations Research 46 (1998) 316-329
20. Benders J.F. Partitioning procedures for solving mixed variables programming. Numerische Mathematik 4 (1962) 238-252
21. Benichou M., Gauthier J.M., Girodet P., Hentges G., Ribiere G., and Vincent O. Experiments in mixed-integer programming. Mathematical Programming 1 (1971) 76-94
22. Bienstock D., and Zuckerberg M. Subset algebra lift operators for 0-1 integer programming. Technical Report CORC Report 2002-01 (2003), Columbia University, New York
23. Bixby R.E. Lectures on Linear Programming (1994), Rice University, Houston, Texas, Spring
24. Bixby R.E., Ceria S., McZeal C., and Savelsbergh M.W.P. An updated mixed integer programming library: MIPLIB 3.0. Paper and Problems are available at WWW Page (1998). http://www.caam.rice.edu/∼bixby/miplib/miplib.html
25. Bixby R.E., Fenelon M., Guand Z., Rothberg E., and Wunderling R. MIP: theory and practice closing the gap. Technical Report (1999), ILOG Inc., Paris, France
26. Borndörfer R. Aspects of Set Packing, Partitioning, and Covering (1998), Shaker, Aachen
27. Borndörfer R., Ferreira C.E., and Martin A. Decomposing matrices into blocks. SIAM Journal on Optimization 9 (1998) 236-269
28. Ceria S., Cordier C., Marchand H., and Wolsey L.A. Cutting planes for integer programs with general integer variables. Mathematical Programming 81 (1998) 201-214
29. Chopra S., and Rao M.R. The Steiner tree problem I: formulations, compositions and extension of facets. Mathematical Programming 64 2 (1994) 209-229
30. Clochard, J. M., D. Naddef (1993). Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem, in: L. A. Wolsey, G. Rinaldi (eds.), Proceedings on the Third IPCO Conference 291-311.
31. COIN. A COmputational INfrastructures for Operations Research (2002). URL: http://www124.ibm.com/developerworks/opensource/coin
32. Cordier C., Marchand H., Laundy R., and Wolsey L.A. bc - opt: a branch-and-cut code for mixed integer programs. Mathematical Programming 86 (1999) 335-354
33. Crowder H., Johnson E., and Padberg M.W. Solving large-scale zero-one linear programming problems. Operations Reserch 31 (1983) 803-834
34. Dantzig G.B., and Wolfe P. Decomposition principle for linear programs. Operations Research 8 (1960) 101-111
35. DASH Optimization. Blisworth House, Church Lane, Blisworth, Northants NN7 3BX, UK. XPRESS-MP Optimisation Subroutine Library (2001). Information available at URL http://www.dash.co.uk
36. de Farias I.R., Johnson E.L., and Nemhauser G.L. Facets of the complementarity knapsack polytope. Mathematics of Operations Research 27 (2002) 210-226
37. Eckstein J. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization 4 (1994) 794-814
38. Ferreira C.E. On Combinatorial Optimization Problems Arising in Computer System Design (1994), Technische Universität, Berlin PhD thesis
39. Ferreira C.E., Martin A., and Weismantel R. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization 6 (1996) 858-877
40. Fischetti M., and Lodi A. Local branching. Mathematical Programming 98 (2002) 23-47
41. Fourer R., Gay D.M., and Kernighan B.W. AMPL: A Modeling Language for Mathematical Programming (1993), Duxbury Press/Brooks/Cole Publishing Company
42. Fulkerson D.R. Blocking and anti-blocking pairs of polyhedra. Mathematical Programming 1 (1971) 168-194
43. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman and Company, New York
44. Goffin, J. L., J. P. Vial (1999). Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method. Technical Report 99.02, Logilab, Universite de Geneve. To appear in Optimization Methods and Software
45. Gomory R.E. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society 64 (1958) 275-278
46. Gomory R.E. An algorithm for the mixed integer problem. Technical Report RM-2597 (1960), The RAND cooperation
47. Gomory, R. E. (1960). Solving linear programming problems in integers, in: R. Bellman M. Hall (eds.), Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics Vol. 10, Providence RI.
48. Gondzio J. Presolve analysis of linear programs prior to apply an interior point method. INFORMS Journal on Computing 9 (1997) 73-91
49. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer
50. Grötschel M., Monma C.L., and Stoer M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research 40 (1992) 309-330
51. Gu Z., Nemhauser G.L., and Savelsbergh M.W.P. Cover inequalities for 0-1 linear programs: complexity. INFORMS Journal on Computing 11 (1998) 117-123
52. Gu Z., Nemhauser G.L., and Savelsbergh M.W.P. Cover inequalities for 0-1 linear programs: computation. INFORMS Journal on Computing 10 (1998) 427-437
53. Gu Z., Nemhauser G.L., and Savelsbergh M.W.P. Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming 85 (1999) 439-468
54. Gu Z., Nemhauser G.L., and Savelsbergh M.W.P. Sequence independent lifting in mixed integer programming. Journal on Combinatorial Optimization 4 (2000) 109-129
55. Hammer P.L., Johnson E., and Peled U.N. Facets of regular 0-1 polytopes. Mathematical Programming 8 (1975) 179-206
56. Held M., and Karp R. The traveling-salesman problem and minimum spanning trees: part II. Mathematical Programming 1 (1971) 6-25
57. Hiriart-Urruty J.B., and Lemarechal C. Convex analysis and minimization algorithms, part 2: advanced theory and bundle methods. Grundlehren der Mathematischen Wissenschaften Vol. 306 (1993), Springer-Verlag
58. Hoffman K.L., and Padberg M.W. Improved LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing 3 (1991) 121-134
59. ILOG CPLEX Division. 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callabel Library (1997). Information available at URL http://www.cplex.com
60. ILOG CPLEX Division. 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callabel Library (2000). Information available at URL http://www.cplex.com
61. Johnson E., and Padberg M.W. A note on the knapsack problem with special ordered sets. Operations Research Letters 1 (1981) 18-22
62. Johnson E.L., Nemhauser G.L., and Savelsbergh M.W.P. Progress in linear programming based branch-and-bound algorithms: an exposition. INFORMS Journal on Computing 12 (2000) 2-23
63. Klabjan D., Nemhauser G.L., and Tovey C. The complexity of cover inequality separation. Operations Research Letters 23 (1998) 35-40
64. Koch, T. (2001). ZIMPL user guide. Technical Report Preprint 01-20, Konrad-Zuse-Zentrum Für Informationstechnik Berlin
65. Koch T., Martin A., and Voß S. SteinLib: an updated library on Steiner tree problems in graphs. In: Du D.-Z., and Cheng X. (Eds). Steiner Tress in Industries (2001), Kluwer 285-325
66. Land A., and Powell S. Computer codes for problems of integer programming. Annals of Discrete Mathematics 5 (1979) 221-269
67. Lasserre, J. B. (2001). An explicit exact SDP relaxation for nonlinear 0-1 programs, in: K. Aardal, A. M. H. Gerards (eds.), Lecture Notes in Computer Science, 293-303.
68. Lemaréchal C., and Renaud A. A geometric study of duality gaps, with applications. Mathematical Programming 90 (2001) 399-427
69. Linderoth J.T., and Savelsbergh M.W.P. A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing 11 (1999) 173-187
70. Lindo Systems Inc. Optimization Modeling with LINDO (1997). See web page: http://www.lindo.com
71. Löbel A. Optimal Vehicle Scheduling in Public Transit. PhD thesis (1997), Technische Universität Berlin
72. Löbel A. Vehicle scheduling in public transit and lagrangean pricing. Management Science 12 44 (1998) 1637-1649
73. Lovász L., and Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1 (1991) 166-190
74. Lübbecke J.E., and Jacques Desrosiers. Selected topics in column generation. Technical Report (2002), Braunschweig University of Technology, Department of Mathematical Optimization
75. Marchand H. A Polyhedral Study of the Mixed Knapsack Set and its Use to Solve Mixed Integer Programs. PhD thesis (1998), Université Catholique de Louvain, Louvain-la-Neuve, Belgium
76. Marchand H., Martin A., Weismantel R., and Wolsey L.A. Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics 123/124 (2002) 391-440
77. Marchand H., and Wolsey L.A. The 0-1 knapsack problem with a single continuous variable. Mathematical Programming 85 (1999) 15-33
78. Marchand H., and Wolsey L.A. Aggregation and mixed integer rounding to solve MIPs. Operations Research 49 (2001) 363-371
79. Martin A. Integer programs with block structure (1998), Habilitations-Schrift, Technische Universität Berlin. Available as ZIB-Preprint SC-99-03, see www.zib.de
80. Martin, A., R. Weismantel (1998). The intersection of knapsack polyhedra and extensions, in: R. E., Bixby, E. A. Boyd, R. Z. Fíos-Mercado (eds.), Integer Programming and Combinatorial Optimization, Proceedings of the 6th IPCO Conference, 243-256
81. Mitra G. Investigations of some branch and bound strategies for the solution of mixed integer linear programs. Mathematical Programming 4 (1973) 155-170
82. Naddef D. Polyhedral theory and branch-and-cut algorithms for the symmetric tsp. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and its Variations (2002), Kluwer
83. Nemhauser G.L., Savelsbergh M.W.P., Minto G., and Sigismondi C. MINTO a mixed integer optimizer. Operations Research Letters 15 (1994) 47-58
84. Nemhauser G.L., and Vance P.H. Lifted cover facets of the 0-1 knapsack Polytope with GUB constraints. Operations Research Letters 16 (1994) 255-263
85. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley
86. Nemhauser G.L., and Wolsey L.A. A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379-390
87. Padberg M.W. On the facial structure of set packing polyhedra. Mathematical Programming 5 (1973) 199-215
88. Padberg M.W. A note on zero-one programming. OR 23 4 (1975) 833-837
89. Padberg M.W. (1,k)-Configurations and facets for packing problems. Mathematical Programming 18 (1980) 94-99
90. Padberg M.W. Linear Optimization and Extensions (1995), Springer
91. Padberg M.W. Classical cuts for mixed-integer programming and branch-and-cut. Mathematical Methods of OR 53 (2001) 173-203
92. Pedberg M.W., Van Roy T.J., and Wolsey L.A. Valid inequalities for fixed charge problems. Operations Research 33 (1985) 842-861
93. Pochet Y. Valid inequalities and separation for capacitated economic lot-sizing. Operations Research Letters 7 (1988) 109-116
94. Ralphs T.K. SYMPHONY Version 2.8 User's Manual (September, 2000). Information available at http://www.lehigh.edu/inime/ralphs.htm
95. Richard J.P., de Farias I.R., and Nemhauser G.L. Lifted inequalities for 0-1 mixed integer programming: basic theory and algorithms. Lecture Notes in Computer Science (2001)
96. Van Roy T.J., and Wolsey L.A. Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 4 (1986) 199-213
97. Van Roy T.J., and Wolsey L.A. Solving mixed integer programming problems using automatic reformulation. Operations Research 35 (1987) 45-57
98. Vasek Chvátal. Linear Programming (1983), W. H. Freeman and Company
99. Savelsbergh M.W.P. Preprocessing and probing for mixed integer programming problems. ORSA J. on Computing 6 (1994) 445-454
100. Savelsbergh M.W.P. Branch-and-price: integer programming with column generation. In: Pardalos P., and Flouda C. (Eds). Encylopedia of Optimization (2001), Kluwer
101. Schrijver A. Theory of Linear and Integer Programming (1986), Wiley, Chichester
102. Sharda R. Linear programming solver software for personal computers: 1995 report. OR{plus 45 degree rule}MS Today 22 5 (1995) 49-57
103. Sherali H., and Adams W. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics 3 (1990) 411-430
104. Sherali H.D., and Fraticelli B.M.P. A modification of Benders' decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse. Journal of Global Optimization 22 (2002) 319-342
105. Suhl U.H., and Szymanski R. Supernode processing of mixed-integer models. Computational Optimization and Applications 3 (1994) 317-331
106. Thienel S. ABACUS A Branch-And-Cut System. PhD thesis (1995), Universität zu Köln
107. Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 46 (1999) 565-594
108. Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48 1 (2000) 111-128
109. Weismantel R. On the 0/1 knapsack polytope. Mathematical Programming 77 1 (1997) 49-68
110. Wilson D.G. A brief introduction to the ibm optimization subroutine library. SIAG/OPT Views and News 1 (1992) 9-10
111. Wolsey L.A. Faces of linear inequalities in 0-1 variables. Mathematical Programming 8 (1975) 165-178
112. Wolsey L.A. Valid inequalities for 0-1 knapsacks and MIPs with generalized upper bound constraints. Discrete Applied Mathematics 29 (1990) 251-261
113. Zemel E. Easily computable facets of the knapsack polytope. Mathematics of Operations Research 14 (1989) 760-764
114. Zhao X., and Luh P.B. New bundle methods for solving Lagrangian relaxation dual problems. Journal of Optimization Theory and Applications 113 2 (2002) 373-397