Skip to main content
SpringerLink
Log in

Hooked on IP

  • 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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Barnhart, C., E.L. Johnson, G.L. Nemhauser, M. Savelsbergh, and P. Vance. (1998). “Branch-and-Price: Column Generation for Solving Huge Integer Problems.” Operations Research, 46, 316–329.

    Google Scholar 

  • Chvatal, V. (1973). “Edmonds Polytopes and a Hierarchy of Combinatorial Problems.” Discrete Mathematics, 4, 305–337.

    Article  Google Scholar 

  • Crowder, H.P., E.L. Johnson, and M.W. Padberg. (1983). “Solving Large-Scale 0–1 Linear Programming Problems.” Operations Research, 31, 803–834.

  • Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.” Management Science, 23, 789–810.

    Google Scholar 

  • Dantzig, G.B., D.R. Fulkerson, and S.M. Johnson. (1954). “Solution of a Large-Scale Traveling Salesman Problem.” Operations Research, 2, 393–410.

    Google Scholar 

  • Fisher, M.L., G.L. Nemhauser, and L.A. Wolsey. (1978). “An Analysis of Approximations for Maximizing Submodular Set Functions-I. “Mathematical Programming, 14, 265–294.

  • Fulkerson, D.R., G.L. Nemhauser, and L.E. Trotter, Jr. (1974). “Two Computationally Difficult Set Covering Problems That Arise in Computing the 1-Width of Incidence Matrices of Steiner Triple Systems.” Mathematical Programming Study, 2, 72–81.

    Google Scholar 

  • Garfinkel, R.S. and G.L. Nemhauser. (1970). “Optimal Political Districting by Implicit Enumeration Techniques.” Management Science, 16, 495–508.

    Article  Google Scholar 

  • Garfinkel R.S., and G.L. Nemhauser. (1972). Integer Programming. Wiley.

  • Gomory, R.E. (1960). An Algorithm for the Mixed Integer Problem, RM-2597, The Rand Corporation.

  • Groetschel, M. (1980). “On the Symmetric Traveling Salesman Problem: Solution of a 120 City Problem.” Mathematical Programming Study, 12, 61–77.

    Google Scholar 

  • Hane, C., C. Barnhart, E.L. Johnson, R. Marsten, G.L. Nemhauser, and G. Sigismondi. (1995). “The Fleet Assignment Problem: Solving a Large-scale Integer Program.” Mathematical Programming, 70, 211–232.

    Google Scholar 

  • Klabjan, D., E.L. Johnson, and G.L. Nemhauser (2001). “Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching.” Computational Optimization and Applications, 20, 73–91.

    Article  Google Scholar 

  • Nemhauser, G.L., M. Savelsbergh, and G. Sigismondi. (1994). “MINTO: A Mixed INTeger Optimizer.” Operations Research Letters, 15, 47–58.

    Article  Google Scholar 

  • Nemhauser, G.L. and L.E. Trotter, Jr. (1975). “Vertex Packings: Structural Properties and Algorithms.” Mathematical Programming, 8, 232–248.

    Article  Google Scholar 

  • Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization, Wiley.

  • Nemhauser, G.L. and L.A. Wolsey. (1990). “A Recursive Procedure to Generate All Cuts in Mixed-Integer Programs.” Mathematical Programming, 46, 379–390.

    Article  Google Scholar 

  • Padberg, M.W. and S. Hong. (1980). “On the Symmetric Traveling Salesman Problem: A Computational Study.” Mathematical Programming Study, 12, 78–107.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 30332, USA

    George L. Nemhauser

Authors
  1. George L. Nemhauser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George L. Nemhauser.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nemhauser, G.L. Hooked on IP. Ann Oper Res 149, 157–161 (2007). https://doi.org/10.1007/s10479-006-0097-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0097-5

Keywords

Search

Navigation