Hooked on IP

Annals of Operations Research

Volumn 149, Issue 1, 2007, Pages 157-161

  Nemhauser, George L ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846870596     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0097-5     Document Type: Review

References (18)

1. 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.
2. Chvatal, V. (1973). "Edmonds Polytopes and a Hierarchy of Combinatorial Problems." Discrete Mathematics, 4, 305-337.
3. Crowder, H.P., E.L. Johnson, and M.W. Padberg. (1983). "Solving Large-Scale 0-1 Linear Programming Problems." Operations Research, 31, 803-834.
4. 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.
5. Dantzig, G.B., D.R. Fulkerson, and S.M. Johnson. (1954). "Solution of a Large-Scale Traveling Salesman Problem." Operations Research, 2, 393-410.
6. 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.
7. 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.
8. Garfinkel, R.S. and G.L. Nemhauser. (1970). "Optimal Political Districting by Implicit Enumeration Techniques." Management Science, 16, 495-508.
9. Garfinkel R.S., and G.L. Nemhauser. (1972). Integer Programming. Wiley.
10. Gomory, R.E. (1960). An Algorithm for the Mixed Integer Problem, RM-2597, The Rand Corporation.
11. Groetschel, M. (1980). "On the Symmetric Traveling Salesman Problem: Solution of a 120 City Problem." Mathematical Programming Study, 12, 61-77.
12. 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.
13. 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.
14. Nemhauser, G.L., M. Savelsbergh, and G. Sigismondi. (1994). "MINTO: A Mixed INTeger Optimizer." Operations Research Letters, 15, 47-58.
15. Nemhauser, G.L. and L.E. Trotter, Jr. (1975). "Vertex Packings: Structural Properties and Algorithms." Mathematical Programming, 8, 232-248.
16. Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization, Wiley.
17. Nemhauser, G.L. and L.A. Wolsey. (1990). "A Recursive Procedure to Generate All Cuts in Mixed-Integer Programs." Mathematical Programming, 46, 379-390.
18. Padberg, M.W. and S. Hong. (1980). "On the Symmetric Traveling Salesman Problem: A Computational Study." Mathematical Programming Study, 12, 78-107.