Integer programming: Methods, uses, computation

50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art

Volumn , Issue , 2010, Pages 133-197

  Balinski, Michel ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885736749     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-68279-0_6     Document Type: Chapter

References (105)

1. ALCALY, ROGER E. AND KLEVORICK, ALVIN K., "A Note on the Dual Prices of Integer Programs," to appear in Econometrica.
2. BALINSKI, MICHEL L., "Fixed-Cost Transportation Problems," Naval Research Logistics Quarterly, Vol. 8 (1961), pp. 41-54.
3. -, "On Finding Integer Solutions to Linear Programs," in Proceedings of the IBM Scientific Symposium on Combinatorial Problems, Herbert Koenig, Ed., to appear, 1965.
4. -, AND NORMAN, MORRIS, "Experiments With Set Covering Problems," Mathematica Working Paper, January 1965.
5. - AND QUANDT, R. E., "On an Integer Program for a Delivery Problem," Operations Research, Vol. 12 (1964), pp. 300-304.
6. - AND WOLFE, PHILIP, "On Benders Decomposition and a Plant Location Problem," Mathematica Working Paper, ARO-27, December 27, 1963.
7. BAUMOL, WILLIAM J. AND WOLFE, PHILIP, "A Warehouse Location Problem," Operations Research, Vol. 6 (1958), pp. 252-263.
8. BAUER, F. L., "Algorithm 153, Gomory," Communications of the Association f or Computing Machinery, Vol. 6, No 2 (1963).
9. BEALE, E. M. L., "A Method of Solving Linear Programming Problems when some but not all of the Variables must take Integral Values," Statistical Techniques Research Group, Technical Report No. 19, Princeton University, July 1958.
10. BELLMAN, RICHARD, "Maximization over Discrete Sets," Naval Research Logistics Quarterly, Vol. 3 (1956), pp. 67-70.
11. - AND DREYFUS, STUART E., Applied Dynamic Programming, Princeton University Press, 1962.
12. - AND HALL, MARSHALL, JR., Eds., Combinatorial Analysis, Proceedings of the Tenth Symposium in Applied Mathematics of the American Mathematical Society, 1960.
13. BENDERS, J. F., "Partitioning Procedures for Solving Mixed-Variables Programming Problems," Numerische Mathematik, Vol. 4 (1962), pp. 238-252.
14. -, CATCHPOLE, A. R. AND KUIKEN, C, "Discrete Variables Optimization Problems," Rand Symposium on Mathematical Programming, March 16-20, 1959.
15. BEN-ISRAEL, A. and CHARNES, A., "On Some Problems of Diophantine Programming," Cahiers du Centre d'Etudes de Récherche Operationelle (Bruxelles), Vol. 4 (1962), pp. 215-280.
16. BENNET, J. M. and DAKIN, R. J., "Experience with Mixed Linear Programming Problems," University of Sydney, mimeographed report, October 26, 1961.
17. BLANKINSHIP, W. A., "A New Version of the Euclidean Algorithm," American Mathematical Monthly, Vol. 70 (1963), pp. 742-745.
18. BUZBY, B. R.; STONE, B. J. AND TAYLOR, R. L. "Computational Experience with a Non-Linear Distribution Program," Union Carbide Corporation, privately communicated, January 5, 1965.
19. CAMION, P., "Une Mèthode de Résolution par l'Algebre de Boole des Problèmes Combinatoires ou Interviennent des Entiers," Cahiers du Centre D'Etudes de Récherche Operationelle, Vol. 2 (1960), pp. 234-289.
20. COBHAM, A., FRIDSHAL, R. and NORTH, J. H., "An Application of Linear Programming to the Minimization of Boolean Functions," Research Report RC-472, IBM Research Center, June 9, 1961.
21. - AND - "A Statistical Study of the Minimization of Boolean Functions Using Integer Programming," Research Report RC-756, IBM Research Center, June 21, 1962.
22. - AND NORTH, J. H., "Extensions of the Integer Programming Approach to the Minimization of Boolean Functions," Research Report RC-915, IBM Research Center, April 2, 1963.
23. CORD, JOEL, "A Method of Balancing Assembly Lines Using Linear Programming," A. 0. Smith Corporation, privately circulated paper, October 1963.
24. DAKIN, R. J., "Application of Mathematical Programming Techniques to Cost Optimization in Power Generating Systems," Technical Report No. 19, Basser Computing Department, School of Physics, The University of Sydney, December 1961.
25. DANTZIG, G. B., "Application of the Simplex Method to a Transportation Problem, pp. 359-373 in Activity Analysis of Production and Allocation, T. C. Koopmans, Ed., Cowles Commission Monograph No. 13, John Wiley and Sons, Inc., 1951.
26. -, "Discrete-Variable Extremum Problems," Operations Research, Vol. 5 (1957), pp. 266-277.
27. -, Linear Programming and Extensions, Princeton University Press, Princeton, N. J., 1963.
28. -, "Note on Solving Linear Programs in Integers," Naval Research Logistics Quarterly, Vol. 6 (1959), pp. 75-76.
29. -, "On the Significance of Solving Linear Programming Problems with some Integer Variables," Econometrica, vol. 28 (1960), pp. 30-44.
30. -, FULKERSON, D. R. AND JOHNSON, S. M., "On a Linear Programming, Combinatorial Approach to the Travelling Salesman Problem," Operations Research, Vol. 7 (1959), pp. 58-66.
31. -, - AND -, "Solution of a Large Scale Travelling Salesman Problem," Journal of the Operations Research Society of America, Vol. 2 (1954), pp. 393-410.
32. - AND WOLFE, PHILIP, "The Decomposition Algorithm for Linear Programs," Econometrica, Vol. 29 (1961), pp. 767-778.
33. D'ESOPO, D. A. and LEFKOWITZ, B., "Certification of Algorithm 153," Communications of the Association for Computing Machinery, Vol. 6, No. 8 (1963).
34. - AND -, "Note on an Integer Linear Programming Model for Determining a Minimum Embarkation Fleet," Naval Research Logistics Quarterly, Vol. 11 (1964), pp. 79-82.
35. EDMONDS, JACK, "Covers and Packings in a Family of Sets," Bulletin of the American Mathematical Society, Vol. 68 (1962), pp. 494-499.
36. -, "Maximum Matching and a Polyhedron with 0, 1-vertices," Princeton University and National Bureau of Standards, March 1963, mimeographed report.
37. -, "Paths, Trees, and Flowers," National Bureau of Standards and Princeton University, February 1963, mimeographed report.
38. FORD, L. R., JR. AND FULKERSON, D. R., "A Suggested Computation for Maximal Multi-Commodity Network Flows," Management Science, Vol. 5 (1958), pp. 97-101.
39. - AND -, Flows in Networks, Princeton University Press, 1963.
40. FULKERSON, D. R. and RYSER, H. J., "Widths and Heights of (0, 1)-Matrices," Canadian Journal of Mathematics, Vol. 13 (1961), pp. 239-255.
41. GIGLIO, RICHARD J., and WAGNER, HARVEY M., "Approximate Solutions to the Three Machine Scheduling Problem," Operations Research, Vol. 12 (1964), pp. 305-324.
42. GILBERT, E. J. and SCHATZ, J. A., "An Ill-Conceived Proposal for Apportionment of the U. S. House of Representatives," Operations Research, Vol. 12 (1964), pp. 768-773.
43. GILMORE, P. C. AND GOMORY, R. E., "A Linear Programming Approach to the Cutting Stock Problem-Part II," Operations Research, Vol. 11 (1963), pp. 863-888. 44.
44. - AND - "A Solvable Case of the Travelling Salesman Problem," Proceedings of the National Academy of Sciences, Vol. 51 (1964), pp. 178-181.
45. - AND -, "Multi-Stage Cutting Stock Problems of Two and More Dimensions," Operations Research, Vol. 13 (1965), pp. 94-120.
46. - AND -, "Sequencing a One State Variable Machine: A Solvable Case of the Travelling Salesman Problem," IBM Watson Research Center, Report RC-1103, January 24, 1964.
47. GLOVER, FRED, "A Bound Escalation Method for the Solution of Integer Linear Programs," Graduate School of Industrial Administration, Carnegie Institute of Technology, Pittsburgh, Pennsylvania, December 1963.
48. GOMORY, R. E., "All-Integer Integer Programming Algorithm," pp. 193-206 in [80]. First issued as IBM Research Center, Research Report RC-189, January 29, 1960.
49. -, "An Algorithm for Integer Solutions to Linear Programs," pp. 269-302 in [57]. First issued as Princeton-IBM Mathematics Research Project, Technical Report Number 1, November 17, 1958.
50. -, "An Algorithm for the Mixed Integer Problem," RM-2597 Rand Corporation, July 7, 1960.
51. -, "Large and Non-Convex Problems in Linear Programming," in Experimental Arithmetic, High Speed Computing and Mathematics, Proceedings of Symposium in Applied Mathematics, Volume XV, American Mathematical Society, 1963.
52. -, "On the Relation Between Integer and Non-Integer Solutions to Linear Programs," Proceedings of the National Academy of Sciences, Vol. 53 (1965), pp. 260-265.
53. -, "Outline of an Algorithm for Integer Solutions to Linear Programs," Bulletin of the American Mathematical Society, Vol. 64 (1958), pp. 275-278.
54. -, "Solving Linear Programming Problems in Integers," pp. 211-216 in [12].
55. - AND BAUMOL, WILLIAM J., "Integer Programming and Pricing," Econometrica, Vol. 28 (1960), pp. 521-550.
56. -AND HOFFMAN, A. J., "On the Convergence of an Integer-Programming Process," Naval Research Logistics Quarterly, Vol. 10 (1963), pp. 121-123.
57. GRAVES, ROBERT L. AND WOLFE, PHILIP, Editors, Recent Advances in Mathematical Programming, McGraw-Hill Book Company, Inc., 1963.
58. HALDI, JOHN, "25 Integer Programming Test Problems," Working Paper No. 43, Graduate School of Business, Stanford University, December 1964.
59. - AND ISAACSON, LEONARD M., "Linear Integer Programming," Working Paper No. 45, Graduate School of Business, Stanford University, December 1964.
60. HEALY, W. C, JR., "Multiple Choice Programming," Operations Research, Vol. 12 (1964), pp. 122-138.
61. HOFFMAN, A. J., "Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinatorial Analysis," pp. 113-128 in [12].
62. HOHN, FRANZ, "Some Mathematical Aspects of Switching," American Mathematical Monthly, Vol. 62 (1955), pp. 75-90.
63. HUNTINGTON, EDWARD V., "The Apportionment of Representatives in Congress," Transactions of the American Mathematical Society, Vol. 30 (1928), pp. 85-110.
64. HUNTINGTON, EDWARD V., A Survey of Methods of Apportionment in Congress, 76th Congress, 3rd Session Document No. 304, U. S. Government Printing Office, Washington, D. C, 1940.
65. KARP, RICHARD M., "Minimum-Redundancy Coding for the Discrete Noiseless Channel," IRE Transactions of the Professional Group on Information Theory, Vol. IT-7, No. 1 (1961), pp. 27-38.
66. KÜHN, HAROLD W., "On Certain Convex Polyhedra," Bulletin of the American Mathematical Society, Vol. 61 (1955), pp. 557-558
67. - AND TUCKER, A. W., Eds., Linear Inequalities and Related Systems, Annals of Mathematics Study No. 38, Princeton University Press, 1956.
68. KUNZI, HANS P. AND OETTLI, WERNER, "Integer Quadratic Programming," pp. 303-308 in [57].
69. LAND, A. H. and DOIG, A. G., "An Automatic Method of Solving Discrete Programming Problems," Econometrica, Vol. 28 (1960), pp. 497-520.
70. LAWLER, E. L., "An Algorithm for Solving Covering Problems," University of Michigan, mimeographed report, December 11, 1964.
71. -, "Duality of Covering Problems," University of Michigan, mimeographed report, December 7, 1964.
72. LEVITAN, R. E., IPM 8, Share Distribution Number 1190, September 1961.
73. LITTLE, JOHN D. C, MURTY, KATTA G., SWEENEY, DURA W. AND CAROLINE, KAREL, "An Algorithm for the Travelling Salesman Problem," Operations Research, Vol. 11 (1963), pp. 972-989.
74. MANNE, ALAN S., "On the Job-Shop Scheduling Problem," Operations Research, Vol. 8 (1960), pp. 219-223. Also, pp. 187-192 in [80].
75. -, "Plant Location under Economics of Scale-Decentralization and Computation," Management Science, Vol. 11 (1964), pp. 213-235.
76. MARKOWITZ, HARRY M. AND MANNE, ALAN S., "On the Solution of Discrete Programming Problems," Econometrica, Vol. 25 (1957), pp. 84-110.
77. MARTIN, GLENN T., "An Accelerated Euclidean Algorithm for Integer Linear Programming," pp. 311-318 in [57].
78. MCCLUSKEY, E. J., "Error Correcting Codes-A Linear Programming Approach," The Bell System Technical Journal, Vol. XXXVIII (1959), pp. 1485-1512.
79. MILLER, C. E., TUCKER, A. W. and ZEMLIN, R. A., "Integer Programming Formulation of Travelling Salesman Problems," Journal of the Association for Computing Machinery, Vol. 7 (1960), pp. 326-329.
80. MUTH, JOHN F. AND THOMPSON, GERALD L., Eds., Industrial Scheduling, Prentice-Hall, New York, 1963.
81. NORMAN, R. Z. and RABIN, M. O., "An Algorithm for the Minimum Cover of a Graph," Proceedings of the American Mathematical Society, Vol. 10 (1959), pp. 315-319.
82. OUYAHIA, AIT, "Programmes Lineaires a Variables Discretes," Revue Francaise de Récherche Operationelle, Vol. 6 (1962), pp. 55-75.
83. PETERSEN, J., "Die Theorie der regulären Graphen," Acta Mathematica, Vol. 51 (1891), pp. 193-220.
84. PYNE, I. B. and MCCLUSKEY, E. J., JR., "An Essay on Prime Implicant Tables," Journal of the Society f or Industrial and Applied Mathematics, Vol. 9 (1961), pp. 604-631.
85. QUINE, W. V., "A Way to Simplify Truth Functions," American Mathematical Monthly, Vol. 62 (1955), pp. 627-631.
86. ROTH, J. P., "Algebraic Topological Methods for the Synthesis of Switching Systems, I," Transactions of the American Mathematical Society, Vol. 88 (1958), pp. 301-326.
87. SHANNON, C. E., "A Symbolic Analysis of Relay and Switching Circuits," Transactions of the American Institute of Electrical Engineers, Vol. 57 (1938), pp. 713-723.
88. STORY, A. E. and WAGNER, H. M., "Computational Experience With Integer Programming for Job-Shop Scheduling," pp. 207-220 in [80].
89. TAYLOR, R. L., "Carbide Warehouse Selection Program," Union Carbide Corporation, privately communicated, April 1964.
90. THOMPSON, GERALD L., "The Stopped Simplex Method: Basic Theory for Mixed Integer Programming," Revue Francaise de Récherche Operationelle, Vol. 8 (1964), pp. 159-182.
91. TUCKER, A. W., "A Combinatorial Equivalence of Matrices," pp. 129-140 in [12].
92. VAN DER WAERDEN, B. L., Modern Algebra, Volume II, Frederick Ungar Publishing Co., New York, 1950.
93. VIETORISZ, THOMAS, "Industrial Development Planning Models with Economics of Scale and Indivisibilities," IBM Watson Research Center, RC-1061, September 30, 1963.
94. WADE, C. S. and GOMORY, R. E., IPM 1, Share Distribution Number 1192, September 1961
95. - AND -, IPM 2, Share Distribution Number 1191, September 1961.
96. WAGNER, H. M., "An Integer Linear Programming Model for Machine Shop Schedulng," Naval Research Logistics Quarterly, Vol. 6 (1959), pp. 131-140.
97. -, GIGLIO, RICHARD J. AND GLASER, R. GEORGE, "Preventive Maintenance Scheduling by Mathematical Programming," Management Science, Vol. 10 (1964), pp. 316-334.
98. WEAVER, JAMES B. AND HESS, SYDNEY W., "A Procedure for Non-Partisan Districting: Development of Computer Techniques," Yale Law Journal, Vol. 73 (1963), pp. 288-308.
99. WHITE, WILLIAM W., "On Gomory's Mixed Integer Algorithm," Senior Thesis, Princeton University, May 1, 1961.
100. WITZGALL, CHRISTOPH, "An All-Integer Programming Algorithm with Parabolic Constraints," Journal of the Society for Industrial and Applied Mathematics, Vol. 11 (1963), pp. 855-871.
101. YOUNG, RICHARD D., "A Primal (All Integer) Integer Programming Algorithm: Antecedents, Description, Proof of Finiteness, Exemplification," Working Paper No. 52, Graduate School of Business, Stanford University, December 1964.
102. BALAS, EGON, "Un algorithme additif pour la resolution des programmes lineares en variables bivalentes,", Comptes Rendus, Academie des Sciences, Paris, Vol. 258 (1964), pp. 3817-3820.
103. -, "Extension de l'algorithme additif a la programmation en nombres entiers et a la programmation nonlineare," Comptes Rendus, Academie des Sciences, Paris, Vol. 258 (1964), pp. 5136-5139.
104. BEALE, E. M. L. and SMALL, R. E., "A Branch and Bound Method for Mixed Integer Programming,", Proceedings of the Third IFIP Conference, Vol. 2, 1965, to appear.
105. HARRIS, P. M. J., "An Algorithm for Solving Mixed Integer Linear Programs,", Operational Research Quarterly, Vol. 15 (1964) pp. 117-132.