Broadening the integer programming audience, the LINDO perspective | Annals of Operations Research Skip to main content
Springer Nature Link
Log in

Broadening the integer programming audience, the LINDO perspective

  • 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

  • Andersen, E.D. and K.D. Andersen. (1995). “Presolving in Linear Programming.” Mathematical Programming, 71(2), 221–245.

    Article  Google Scholar 

  • Brearly, A., G. Mitra, and H. Williams. (1975). “An Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm.” Mathematical Programming, 8, 54–83.

    Article  Google Scholar 

  • Conway, R.W. and W.L. Maxwell. (1963). “The Cornell Computing Language.” Communications of the ACM, 6, (6).

  • Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Large-scale Zero-one Linear Programming Problems.” Operations Research.

  • Guignard, M. and K. Spielberg. (1977). “Propagation, Penalty Improvement and Use of Logical Inequalities.” Mathematics of Operations Research, 25, 157–171.

    Google Scholar 

  • Kalan, J. (1971). “Aspects of Large-Scale In-Core Linear Programming.” Southern Methodist University, Dallas, Tex. Proceedings of the 26th annual ACM Conference.

  • Kocis, G. and I. Grossman. (1989). “Computational Experience with DICOPT Solving MINLP Problems in Process Engineering.” Computers and Chemical Engineering, 13(3), 307–315.

    Article  Google Scholar 

  • Land, A. and A. Doig. (1960). “An Automatic Method of Solving Discrete Programming Problems.” Econometrica, 28(3), 497–520.

    Article  Google Scholar 

  • Little, J., K. Murty, D. Sweeney, and C. Karel. (1963). “An Algorithm for the Travelling Salesman Problem.” Operations Research, 11, 972–989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Chicago, Chicago, USA

    Linus Schrage

  2. LINDO Systems, Chicago, USA

    Linus Schrage & Kevin Cunningham

Authors
  1. Linus Schrage
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kevin Cunningham
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schrage, L., Cunningham, K. Broadening the integer programming audience, the LINDO perspective. Ann Oper Res 149, 177–183 (2007). https://doi.org/10.1007/s10479-006-0094-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0094-8

Keywords

Search

Navigation