Lp-based combinatorial problem solving

A tutorial outline of the polyhedral theory that underlies linear programming (LP)-based combinatorial problem solving is given. Design aspects of a combinatorial problem solver are discussed in general terms. Three computational studies in combinatorial problem solving using the polyhedral theory developed in the past fifteen years are surveyed: one addresses the symmetric traveling salesman problem, another the optimal triangulation of input/output matrices, and the third the optimization of large-scale zero-one linear programming problems.

[1]  H. Weyl.  Elementare Theorie der konvexen Polyeder , 1934 .

[2]  W. Leontief.  Quantitative Input and Output Relations in the Economic Systems of the United States , 1936 .

[3]  W. Leontief,et al.  The Structure of American Economy, 1919-1939. , 1954 .

[4]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .

[5]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[6]  Wassily Leontief,et al.  The structure of development , 1963 .

[7]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[8]  H. Weingartner,et al.  Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1964 .

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

[10]  W. Leontief.  Input-output economics , 1967 .

[11]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[12]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[13]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[14]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

[15]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[16]  Peter L. Hammer,et al.  Constraint Pairing In Integer Programming , 1975 .

[17]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[18]  Leslie E. Trotter,et al.  A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..

[19]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[20]  M. Padberg.  Characterisations of Totally Unimodular, Balanced and Perfect Matrices , 1975 .

[21]  P. Macdonald.  Combinatorial Programming: Methods and Applications , 1976 .

[22]  P. Miliotis,et al.  Integer programming approaches to the travelling salesman problem , 1976, Math. Program..

[23]  N. Biggs,et al.  Graph Theory 1736-1936 , 1976 .

[24]  M. Padberg.  On the Complexity of Set Packing Polyhedra , 1977 .

[25]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[26]  Thomas L. Morin,et al.  A hybrid approach to discrete mathematical programming , 2015, Math. Program..

[27]  H. P. Young,et al.  On permutations and permutation polytopes , 1978 .

[28]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[29]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

[30]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[31]  Thomas L. Hankins,et al.  Sir William Rowan Hamilton , 1980 .

[32]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[33]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[34]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[35]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[36]  Manfred W. Padberg.  (1,k)-configurations and facets for packing problems , 1980, Math. Program..

[37]  Roy E. Marsten,et al.  The Design of the XMP Linear Programming Library , 1981, TOMS.

[38]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[39]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[40]  Ellis L. Johnson,et al.  A note of the knapsack problem with special ordered sets , 1981, Oper. Res. Lett..

[41]  Richard M. Karp,et al.  On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..

[42]  M. Padberg,et al.  Degree-two Inequalities, Clique Facets, and Biperfect Graphs , 1982 .

[43]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[44]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[45]  G. Reinelt,et al.  Optimal triangulation of large real world input-output matrices , 1983 .

[46]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[47]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[48]  L. Wolsey,et al.  Solving mixed integer programs y automatic reformulation , 1984 .

[49]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[50]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[51]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[52]  M. Grötschel,et al.  Solving matching problems with linear programming , 1985, Math. Program..

[53]  Linus Schrage,et al.  Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming , 1985, Oper. Res..

[54]  L. Wolsey,et al.  Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .

[55]  Gerhard Reinelt,et al.  On the acyclic subgraph polytope , 1985, Math. Program..

[56]  Martin Grötschel,et al.  Facets of the linear ordering polytope , 1985, Math. Program..

[57]  Laurence A. Wolsey,et al.  Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..

[58]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..