Progress in computational mixed integer programming - A look back from the other side of the tipping point

Annals of Operations Research

Volumn 149, Issue 1, 2007, Pages 37-41

  Bixby, Robert ^a   Rothberg, Edward ^a  

^a ILOG Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846884212     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0091-y     Document Type: Review

References (14)

1. Atamturk, A., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). "Conflict Graphs in Integer Programming." European Journal of Operations Research, 121, 40-55.
2. Balas, E. (1979). "Disjunctive Programming." Annals of Discrete Mathematics, 5, 3-51.
3. Balas, E., S. Ceria, G. Cornuejols, and N. Natraj. (1996). "Gomory Cuts Revisited." Operations Research Letters, 19, 1-10.
4. Bixby, R.E., M. Fenelon, Z. Gu, E.E. Rothberg, and R. Wunderling. (2000). MIP: Theory and Practice-Closing the Gap. Kluwer Academic Publishers, pp. 19-49.
5. Crowder, H.P., E.L. Johnson, and M.W. Padberg. (1983). "Solving Large-Scale Zero-One Linear Programming Problems." Operations Research, 31, 803-834.
6. Gomory, R.E. (1960). "An Algorithm for the Mixed Integer Problem." Technical Report RM-2597, The RAND Corporation.
7. Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1998). "Lifted Cover Inequalities for 0-1 Integer Programs." INFORMS Journal on Computing, 10, 417-426.
8. Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999). "Lifted Flow Covers for Mixed 0-1 Integer Programs." Mathematical Programming, 85, 439-467.
9. Hoffman, K. and M.W. Padberg. (1991). "Improving Representations of Zero-One Linear Programs for Branch-and-Cut." ORSA Journal of Computing, 3, 121-134.
10. Johnson, E.L. and M.W. Padberg. (1983). "Degree-Two Inequalities, Clique Facets, and Bipartite Graphs." Annals of Discrete Mathematics, 16, 169-188.
11. Marchand, H. and L.A. Wolsey. (2001). "Aggregation and Mixed Integer Rounding to Solve MIPs." Operations Research, 49(3), 363-371.
12. Padberg, M.W., T.J. Van Roy, and L.A. Wolsey. (1985). "Valid Inequalities for Fixed Charge Problems." Operations Research, 33, 842-861.
13. Van Roy, T.J. and L.A. Wolsey. (1985). "Valid Inequalities and Separation for Uncapacitated Fixed Charge Networks." Operations Research Letters, 4, 105-112.
14. Weismantel, R. (1997). "On the 0/1 Knapsack Polytope." Mathematical Programming, 77, 49-68.