Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

INFORMS Journal on Computing

Volumn 12, Issue 1, 2000, Pages 2-23

  Johnson, Ellis L ^a   Nemhauser, George L ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Branch and price; Lifting; Mixed integer programming

Indexed keywords

EID: 0345792410     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.1.2.11900     Document Type: Article

References (91)

1. R. ANBIL, J.J. FORREST, and W.R. PULLEYBLANK, 1998. Column Generation and the Airline Crew Pairing Problem, Documenta Mathematica III, 677-686.
2. R. ANBIL, R. TANGA, and E. JOHNSON, 1991. A Global Optimization Approach to Crew Scheduling, IBM Systems Journal 31, 71-78.
3. D. APPLEGATE, R.E. BIXBY, V. CHVATAL, and W.J. COOK, 1997. ABCC TSP, 16th International Symposium on Mathematical Programming, Lausanne, Switserland.
4. B.C. ARNTZEN, G.B. BROWN, T.P. HARRISON, and L.L. TRAFTON, 1995. Global Supply Chain Management at Digital Equipment Corporation, Interfaces 25, 69-93.
5. E. BALAS, S. CERIA, and G. CORNUEJOLS, 1993. A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs, Mathematical Programming 58, 295-324.
6. E. BALAS, S. CERIA, G. CORNUEJOLS, and N. NATRAJ, 1996. Gomory Cuts Revisited, Operations Research Letters 19, 1-9.
7. E. BALAS, S. CERIA, M. DAWANDE, F. MARGOT, and G. PATAKI. OCTANE: A New Heuristic for Pure 0-1 Programs, Operations Research, in press.
8. E. BALAS and R. MARTIN, 1980. Pivot and Complement: A Heuristic for 0-1 Programming, Management Science 26, 86-96.
9. C. BARNHART, E.L. JOHNSON, R. ANBIL, and L. HATAY, 1994. A Column Generation Technique for the Long-Haul Crew Assignment Problem, in Optimization in Industry II, T.A. Ciriani and R.C. Leachman, (eds.), Wiley, Chichester, 7-24.
10. C. BARNHART, E.L. JOHNSON, G.L. NEMHAUSER, M.W.P. SAVELSBERGH, and P.H. VANCE, 1998. Branch-and-Price: Column Generation for Solving Integer Programs, Operations Research 46, 316-329.
11. C. BARNHART, E.L. JOHNSON, G.L. NEMHAUSER, and P.H. VANCE, 1999. Crew Scheduling, in Handbook of Transportation Science, R.W. Hall, (ed.), Kluwer, Boston, 493-521.
12. E.M.L. BEALE, 1979. Branch and Bound Methods for Matnematical Programming Systems, in Discrete Optimization II, P.L. Hammer, E.L. Johnson, and B.H. Korte, (eds.), North-Holland, Amsterdam, 201-219.
13. M. BÉNICHOU, J.M. GAUTHIER, P. GIRODET, G. HENTGES, G. RIBIERE, and O. VINCENT, 1971. Experiments in Mixed-Integer Linear Programming, Mathematical Programming 1, 76-94.
14. D. BERTSIMAS, C. DARNELL, and R. SOUCY, 1999. Portfolio Construction Through Mixed-Integer Programming at Grantham, Mayo, Van Otterloo and Company, Interfaces 29, 49-66.
15. J. BIRGE and F. LOUVEAUX, 1997. Introduction to Stochastic Programming, Springer-Verlag, New York.
16. J. BlSSCHOP and R. ENTRIKEN, 1993. AIMMS The Modeling System, Paragon Decision Technology.
17. R.E. BIXBY, E.A. BOYD, S.S. DADMEHR, and R.R. INDOVINA, 1992. The MIPLIB Mixed Integer Programming Library, Technical Report R92-36, Rice University, Houston, Texas.
18. R.E. BIXBY, S. CERIA, C. MCZEAL, and M.W.P. SAVELSBERGH, 1998. An Updated Mixed Integer Programming Library: MIPLIB 3.0, Optima 58, 12-15.
19. R.E. BIXBY, W. COOK, A. Cox, and E. LEE, 1995. Parallel Mixed Integer Programming, Technical Report CRPC-TR5554, Rice University, Houston, Texas.
20. R.L. BOEHNING, R.M. BUTLER, and B.E. GILLETT, 1988. A Parallel Integer Linear Programming Algorithm, European Journal of Operations Research 34, 393-398.
21. S. BOTHA, I. GRYFFENBERG, F.R. HOFMEYR, J.L. LAUSBERG, R.P. NICOLAY, W.J. SMIT, S. UYS, W.L. VAN DER MERWE, and G.J. WESSELS, 1997. Guns or Butter: Decision Support for Determining the Size and Shape of the South African National Defense Force, Interfaces 27, 7-28.
22. A.L. BREARLEY, G. MITRA, and H.P. WILLIAMS, 1975. Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm, Mathematical Programming 8, 54-83.
23. A. BROOKE, D. KENDRICK, and A. MEERAUS, 1988. GAMS, A User's Guide, Scientific Press, Redwood City, CA.
24. J.D. CAMM, T.E. CHORMAN, F.A. DILL, J.R. EVANS, D.J. SWEENEY, and G.W. WEGRYN, 1997. Blending OR/MS, Judgement, and GIS: Restructuring P&G's Supply Chain, Interfaces 27, 128-142.
25. T.L. CANNON and K.L. HOFFMAN, 1990. Large-Scale 0-1 Programming on Distributed Workstations, Annals of Operations Research 22, 181-217.
26. A. CAPRARA and M. FISCHETTI, 1997. Branch-and-Cut Algorithms, in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello, (eds.), Wiley, Chichester, 45-63.
27. V. CHVÁTAL, 1973. Edmonds Polytopes and a Hierarchy of Combinatorial Problems, Discrete Mathematics 4, 305-327.
28. V. CHVÁTAL, 1973. Edmonds Polytopes and Weakly Hamiltonian Graphs, Mathematical Programming 5, 29-40.
29. G. CORNUEJOLS and M. DAWANDE, 1998. A Class of Hard Small 0-1 Programs, in Proceedings of the 6th International IPCO Conference, R.E. Bixby, E.A. Boyd, and R.Z. Rios-Mercado, (eds.), Springer-Verlag, Berlin, 284-293.
30. CPLEX OPTIMIZATION, INC., 1994. Using the CPLEX Callable Library and CPLEX Mixed Integer Library, Version 3.0.
31. H. CROWDER, E. JOHNSON, and M. PADBERG, 1983. Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31, 803-834.
32. G.B. DANTZIG, D.R. FULKERSON, and S.M. JOHNSON, 1954. Solution of a Large-Scale Traveling Salesman Problem, Operations Research 2, 393-410.
33. G.B. DANTZIG, D.R. FULKERSON, and S.M. JOHNSON, 1959. On a Linear Programming, Combinatorial Approach to the Traveling Salesman Problem, Operations Research 7, 58-66.
34. DASH ASSOCIATES, 1994. XPRESS-MP User Manual.
35. J. DESROSIERS, Y. DUMAS, M.M. SOLOMON, and F. SOUMIS, 1995. Time Constrained Routing and Scheduling, in Handbooks in Operations Research and Management Science, Volume 8: Network Routing, M.O. Ball, T.L. Magnanti, C. Monma, and G.L. Nemhauser, (eds.), Elsevier, Amsterdam, 35-140.
36. B.L. DIETRICH, L.F. ESCUDERO, and F. CHANCE, 1993. Efficient Reformulation for 0-1 Programs: Methods and Computational Results, Discrete Applied Mathematics 42, 147-175.
37. N.J. DRIEBEEK, 1966. An Algorithm for the Solution of Mixed Integer Programming Problems, Management Science 12, 576-587.
38. J. ECKSTEIN, 1994. Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5, SIAM Journal on Optimization 4, 794-814.
39. L.F. ESCUDERO, S. MARTELLO, and P. TOTH, 1996. A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems, in Proceedings of the 4th International IPCO Conference, E. Balas and J. Clausen, (eds.), Springer, Berlin, 110-123.
40. J.J.H. FORREST, J.P.H. HIRST, and J.A. TOMLIN, 1974. Practical Solution of Large Scale Mixed Integer Programming Problems with UMPIRE, Management Science 20, 736-773.
41. R. FOURER, D.M. GAY, and B.W. KERNIGHAN, 1993. AMPL: A Modeling Language for Mathematical Programming, Scientific Press, Redwood City, CA.
42. B. GENDRON and T. CRAINIC, 1994. Parallel Branch-and-Bound Algorithms: Survey and Synthesis, Operations Research 42, 1042-1066.
43. F. GLOVER, 1996, personal communication.
44. M.X. GOEMANS, 1997. Improved Approximation Algorithms for Scheduling with Release Dates, Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 591-598.
45. R. GOMORY, 1960. An Algorithm for the Mixed Integer Problem, Technical Report RM-2597, The Rand Corporation, Santa Monica, CA.
46. R.E. GOMORY, 1958. Outline of an Algorithm for Integer Solutions to Linear Programs, Bulletin of the American Mathematical Society 64, 275-278.
47. M. GRÖTSCHEL, M. JÜNGER, and G. REINELT, 1984. A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research 32, 1195-1220.
48. M. GRÖTSCHEL, C.L. MONMA, and M. STOER, 1992. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints, Operations Research 40, 309-330.
49. M. GRÖTSCHEL, C.L. MONMA, and M. STOER, 1995. Design of Survivable Networks, in Handbooks in Operations Research and Management Science, Volume 7: Network Models, M.O. Ball, T.L. Magnanti, C. Monma, and G.L. Nemhauser, (eds.), Elsevier, Amsterdam, 617-672.
50. M. GRÖTSCHEL and M.W. PADBERG, 1979. On the Symmetric Traveling Salesman Problem II: Lifting Theorems and Facets, Mathematical Programming 16, 281-302.
51. M. GRÖTSCHEL and W.R. PULLEYBLANK, 1986. Clique Tree Inequalities and the Symmetric Traveling Salesman Problem, Mathematics of Operations Research 11, 537-569.
52. Z. Gu, G.L. NEMHAUSER, and M.W.P. SAVELSBERGH, 1998. Cover Inequalities for 0-1 Integer Programs: Computation, INFORMS Journal on Computing 10, 427-437.
53. K. GUE, G.L. NEMHAUSER, and M. PADRON, 1997. Production Scheduling in Almost Continuous Time, IIE Transactions 29, 341-358.
54. M. GUIGNARD and K. SPIELBERG, 1981. Logical Reduction Methods in Zero-One Programming, Operations Research 29, 49-74.
55. L.A. HALL, A.S. SCHULZ, D.B. SHMOYS, and J. WEIN, 1997. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Mathematics of Operations Research 22, 513-544.
56. C. HANE, C. BARNHART, E.L. JOHNSON, R. MARSTEN, G.L. NEMHAUSER, and G.G. SlGISMONDl, 1995. The Fleet Assignment Problem: Solving a Large Integer Program, Mathematical Programming 70, 211-232.
57. K. HOFFMAN and M. PADBERG, 1991. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut, ORSA Journal of Computing 3, 121-134.
58. K. HOFFMAN and M. PADBERG, 1993. Solving Airline Crew Scheduling Problems by Branch-and-Cut, Management Science 39, 667-682.
59. J. HUETER and W. SWART, 1998. An Integrated Labor-Management System for Taco Bell, Interfaces 28, 75-91.
60. IBM CORPORATION, 1990. Optimization Subroutine Library, Guide and Reference.
61. G. INFANGER, 1994. Planning Under Uncertainty, Scientific Press, Redwood City, CA.
62. E.L. JOHNSON, 1989. Modeling and Strong Linear Programs for Mixed Integer Programming, in Algorithms and Model Formulations in Mathematical Programming, NATO ASI Series 51, S.W. Wallace (ed.), 1-41.
63. E.L. JOHNSON and M. PADBERG, 1982. Degree-Two Inequalities, Clique Facets and Biperfect Graphs, Annals of Discrete Mathematics 16, 169-187.
64. M. JÜNGER, G. REINELT, and G. RINALDI, 1995. The Traveling Salesman Problem, in Handbooks in Operations Research and Management Science, Volume 7: Network Models, M.O. Ball, T.L. Magnanti, C. Monma, and G.L. Nemhauser, (eds.), Elsevier, Amsterdam, 225-330.
65. M. JÜNGER and P. STÖRMER, 1995. Solving Large-Scale Traveling Salesman Problems with Parallel Branch-and-Cut, Technical Report 95.191, Universität zu Köln, Cologne, Germany.
66. M. JÜNGER and S. THIENEL, 1998. Introduction to ABACUS: A Branch-And-Cut System, Operations Research Letters 22, 83-95.
67. P. KALL and S.W. WALLACE, 1994. Stochastic programming, Wiley, New York.
68. D. KLABJAN, E.L. JOHNSON, and G.L. NEMHAUSER, 1999. Solving Large Airline Crew Scheduling Problems, Technical Report TLI-99-11, Georgia Institute of Technology, Atlanta, G.A.
69. H.A. LAND and A.G. DOIG, 1960. An Automatic Method for Solving Discrete Programming Problems, Econometrica 28, 497-520.
70. G. LAPORTE and F.V. LOUVEAUX, 1993. The Integer L-Shaped Method for Stochastic Integer Programs, Operations Research letters 13, 133-142.
71. H.W. LENSTRA, JR., 1983. Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research 8, 538-547.
72. J. LlNDEROTH, 1998. Topics in Parallel Integer Programming, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, GA.
73. J. LlNDEROTH and M.W.P. SAVELSBERGH, 1999. Search Strategies for Mixed Integer Programming, INFORMS Journal on Computing 11, 173-187.
74. H. MARCHAND and L. A. WOLSEY, 1999. The 0-1 Knapsack Problem with a Single Continuous Variable, Mathematical Programming 85, 15-33.
75. O. MARTIN, S.W. OTTO, and E.W. FELTEN, 1992. Large Step Markov Chains for the TSP Incorporating Local Search Heuristics, Operations Research Letters 11, 219-224.
76. A. MEHROTRA, E.L. JOHNSON, and G.L. NEMHAUSER, 1998. An Optimization Based Heuristic for Political Districting, Management Science 44, 1100-1114.
77. C.L. MONMA and D.F. SHALLCROSS, 1989. Methods for Designing Communication Networks with Certain Two-Connected Survivability Constraints, Operations Research 37, 531-541.
78. G.L. NEMHAUSER, M.W.F. SAVELSBERGH, and G.C. SIGISMONDI, 1993. MINTO: A Mixed INTeger Optimizer, Operations Research Letters 15, 47-58.
79. G.L. NEMHAUSER and L.A. WOLSEY, 1988. Integer and Combinatorial Optimization, Wiley, New York.
80. M.W. PADBERG and G. RINALDI, 1987. Optimization of a 532 City Symmetric Traveling Salesman Problem by Branch and Cut, Operations Research Letters 6, 1-7.
81. M.W. PADBERG, T.J.V. ROY, and L.A. WOLSEY, 1985. Valid Linear Inequalities for Fixed Charge Problems, Operations Research 33, 842-861.
82. M.W.P. SAVELSBERGH, 1994. Preprocessing and Probing Techniques for Mixed Integer Programming Problems, ORSA Journal on Computing 6, 445-454.
83. M.W.P. SAVELSBERGH, R.M. UMA, and J. WEIN, 1998. An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 453-462.
84. A. SCHRIJVER, 1986. Theory of Linear and Integer Programming, Wiley, Chichester.
85. G.P. SINHA, B.S. CHANDRASEKARAN, N. MITTER, G. DUITA, S.B. SINGH, A.R. CHOUDHURY, and P.N. ROY, 1995. Strategic and Operational Management with Optimization at Tata Steel, Interfaces 25, 6-19.
86. J.A. TOMLIN, 1971. An Improved Branch-and-Bound Method for Integer Programming, Operations Research 19, 1070-1075.
87. P.H. VANCE, A. ATAMTURK, C. BARNHART, E. GELMAN, E.L. JOHNSON, A. KRISHNA, D. MAHIDHARA, G.L. NEMHAUSER, and R. REBELLO, 1997. A Heuristic Branch-and-Price Approach for the Airline Crew Pairing Problem, Technical Report LEC-97-06, Georgia Institute of Technology, Atlanta, GA.
88. P.H. VANCE, C. BARNHART, E.L. JOHNSON, and G.L. NEMHAUSER, 1997. Airline Crew Scheduling: A New Formulation and Decomposition Algorithm, Operations Research 45, 188-200.
89. H.P. WILLIAMS, 1978. Model Building in Mathematical Programming, Wiley, Chichester.
90. H.P. WILLIAMS and J.M. WILSON, 1998. Connections Between Integer Linear Programming and Constraint Logic Programming: An Overview and Introduction to the Cluster of Articles, INFORMS journal on Computing 10, 261-264.
91. L.A. WOLSEY, 1998. Integer Programming, Wiley, New York.