Progress in computational mixed integer programming—A look back from the other side of the tipping point | Annals of Operations Research Skip to main content
Springer Nature Link
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

References

  • Atamturk, A., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). “Conflict Graphs in Integer Programming.” European Journal of Operations Research, 121, 40–55.

    Article  Google Scholar 

  • Balas, E. (1979). “Disjunctive Programming.” Annals of Discrete Mathematics, 5, 3–51.

    Article  Google Scholar 

  • Balas, E., S. Ceria, G. Cornuejols, and N. Natraj. (1996). “Gomory Cuts Revisited.” Operations Research Letters, 19, 1–10.

    Article  Google Scholar 

  • 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.

  • 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 

  • Gomory, R.E. (1960). “An Algorithm for the Mixed Integer Problem.” Technical Report RM-2597, The RAND Corporation.

  • 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 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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 

  • Marchand, H. and L.A. Wolsey. (2001). “Aggregation and Mixed Integer Rounding to Solve MIPs.” Operations Research, 49(3), 363–371.

    Article  Google Scholar 

  • Padberg, M.W., T.J. Van Roy, and L.A. Wolsey. (1985). “Valid Inequalities for Fixed Charge Problems.” Operations Research, 33, 842–861.

    Article  Google Scholar 

  • Van Roy, T.J. and L.A. Wolsey. (1985). “Valid Inequalities and Separation for Uncapacitated Fixed Charge Networks.” Operations Research Letters, 4, 105–112.

    Article  Google Scholar 

  • Weismantel, R. (1997). “On the 0/1 Knapsack Polytope.” Mathematical Programming, 77, 49–68.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ILOG, Inc., 1080 Linda Vista Ave., Mountain View, CA, 94043, USA

    Robert Bixby & Edward Rothberg

Authors
  1. Robert Bixby
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edward Rothberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Bixby.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bixby, R., Rothberg, E. Progress in computational mixed integer programming—A look back from the other side of the tipping point. Ann Oper Res 149, 37–41 (2007). https://doi.org/10.1007/s10479-006-0091-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0091-y

Keywords

Search

Navigation