Annals of Operations Research

, Volume 149, Issue 1, pp 37–41 | Cite as

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

Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.CrossRefGoogle Scholar
  2. Balas, E. (1979). “Disjunctive Programming.” Annals of Discrete Mathematics, 5, 3–51.CrossRefGoogle Scholar
  3. Balas, E., S. Ceria, G. Cornuejols, and N. Natraj. (1996). “Gomory Cuts Revisited.” Operations Research Letters, 19, 1–10.CrossRefGoogle Scholar
  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.Google Scholar
  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.Google Scholar
  6. Gomory, R.E. (1960). “An Algorithm for the Mixed Integer Problem.” Technical Report RM-2597, The RAND Corporation.Google Scholar
  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.Google Scholar
  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.CrossRefGoogle Scholar
  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.Google Scholar
  10. Johnson, E.L. and M.W. Padberg. (1983). “Degree-Two Inequalities, Clique Facets, and Bipartite Graphs.” Annals of Discrete Mathematics, 16, 169–188.Google Scholar
  11. Marchand, H. and L.A. Wolsey. (2001). “Aggregation and Mixed Integer Rounding to Solve MIPs.” Operations Research, 49(3), 363–371.CrossRefGoogle Scholar
  12. Padberg, M.W., T.J. Van Roy, and L.A. Wolsey. (1985). “Valid Inequalities for Fixed Charge Problems.” Operations Research, 33, 842–861.CrossRefGoogle Scholar
  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.CrossRefGoogle Scholar
  14. Weismantel, R. (1997). “On the 0/1 Knapsack Polytope.” Mathematical Programming, 77, 49–68.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.ILOG, Inc.Mountain ViewUSA

Personalised recommendations