Integer Programming: Methods, Uses, Computations

This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Included are descriptions of general algorithms for solving linear programs in integers, as well as some special purpose algorithms for use on highly structured problems. This reflects a belief, on the author's part, that various clever methods of enumeration and other specialized approaches are the most efficacious means existent by which to obtain solutions to practical problems. A serious try at gathering computational experience has been made---but facts are difficult to uncover. The paper is written with intent to enable readers to read selected sections without having to read the whole.

[1]  J. Edmonds.  Covers and packings in a family of sets , 1962 .

[2]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[3]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[4]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[5]  H. M. Wagner,et al.  Approximate Solutions to the Three-Machine Scheduling Problem , 1964 .

[6]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[7]  W. C. Healy.  Multiple Choice Programming A Procedure for Linear Programming with Zero-One Variables , 1964 .

[8]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[9]  A. Klevorick,et al.  A Note on the Dual Prices of Integer Programs , 1966 .

[10]  A. S. Manne,et al.  On the Solution of Discrete Programming Problems , 1956 .

[11]  W. Baumol,et al.  A Warehouse-Location Problem , 1958 .

[12]  Franz Hohn,et al.  Some Mathematical Aspects of Switching , 1955 .

[13]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[14]  F. Glover.  AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM , 1963 .

[15]  G. Dantzig.  Note on solving linear programs in integers , 1959 .

[16]  Richard M. Karp,et al.  Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.

[17]  C. Witzgall,et al.  AN ALL-INTEGER PROGRAMMING ALGORITHM WITH PARABOLIC CONSTRAINTS* , 1963 .

[18]  A. J. Hoffman,et al.  On the convergence of an integer‐programming process , 1963 .

[19]  R. Bellman.  Notes on the theory of dynamic programming IV ‐ Maximization over discrete sets , 1955 .

[20]  R E Gomory,et al.  ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[21]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[22]  B. Lefkowitz,et al.  Note on an integer linear programming model for determining a minimum embarkation fleet , 1964 .

[23]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[24]  W. Blankinship.  A New Version of the Euclidean Algorith , 1963 .

[25]  E. J. Gilbert,et al.  Letter to the Editor-An Ill-Conceived Proposal for Apportionment of the U.S. House of Representatives , 1964 .

[26]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[27]  E. V. Huntington.  The apportionment of representatives in Congress , 1928 .

[28]  I. B. Pyne,et al.  An Essay on Prime Implicant Tables , 1961 .

[29]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[30]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[31]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[32]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[33]  E. McCluskey.  Error-correcting codes — A linear programming approach , 1959 .

[34]  J. Weaver,et al.  A Procedure for Nonpartisan Districting: Development of Computer Techniques , 1963 .

[35]  R. Z. Norman,et al.  An algorithm for a minimum cover of a graph , 1959 .

[36]  Selmer M. Johnson,et al.  On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

[37]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[38]  Ralph E. Gomory,et al.  INTEGER PROGRAMMING AND PRICING , 1960 .

[39]  Friedrich L. Bauer,et al.  Algorithm 152: Nexcom , 1963, CACM.

[40]  J. Roth.  Algebraic topological methods for the synthesis of switching systems. I , 1958 .

[41]  R. Fridshal,et al.  An application of linear programming to the minimization of Boolean functions , 1961, SWCT.

[42]  D. R. Fulkerson,et al.  Widths and heights of (0,1)-matrices. , 1961 .

[43]  Paula M. J. Harris.  An Algorithm for Solving Mixed Integer Linear Programmes , 1964 .

[44]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[45]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .

[46]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[47]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[48]  G. Dantzig.  ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .

[49]  R E Gomory,et al.  A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM. , 1964, Proceedings of the National Academy of Sciences of the United States of America.