Polyhedral techniques in combinatorial optimization II: applications and computations
暂无分享,去创建一个
[1] George B. Dantzig,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..
[2] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[3] Selmer M. Johnson,et al. On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .
[4] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[5] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[6] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[7] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[8] Egon Balas,et al. On the Set-Covering Problem , 1972, Oper. Res..
[9] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[10] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[11] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[12] Laurence A. Wolsey,et al. Faces for a linear inequality in 0–1 variables , 1975, Math. Program..
[13] Peter L. Hammer,et al. Facet of regular 0–1 polytopes , 1975, Math. Program..
[14] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[15] V. Chvátal. On certain polytopes associated with graphs , 1975 .
[16] L. A. Wolsey,et al. Further facet generating procedures for vertex packing polytopes , 1976, Math. Program..
[17] Laurence A. Wolsey,et al. Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..
[18] G. Nemhauser,et al. On the Uncapacitated Location Problem , 1977 .
[19] M. Padberg. On the Complexity of Set Packing Polyhedra , 1977 .
[20] Uri N. Peled. Properties of Facets of Binary Polytopes , 1977 .
[21] Eitan Zemel,et al. Lifting the facets of zero–one polytopes , 1978, Math. Program..
[22] E. Balas,et al. Facets of the Knapsack Polytope From Minimal Covers , 1978 .
[23] László Lovász,et al. Graph Theory and Integer Programming , 1979 .
[24] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .
[25] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[26] Martin Grötschel,et al. On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .
[27] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .
[28] Manfred W. Padberg. (1,k)-configurations and facets for packing problems , 1980, Math. Program..
[29] Monique Guignard-Spielberg,et al. Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables , 1981, Oper. Res..
[30] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[31] W. R. Pulleyblank,et al. Polyhedral Combinatorics , 1989, ISMP.
[32] E. Balas,et al. The perfectly matchable subgraph polytope , 1982 .
[33] Gérard Cornuéjols,et al. Some facets of the simple plant location polytope , 1982, Math. Program..
[34] Gérard Cornuéjols,et al. The Travelling Salesman Polytope and {0, 2}-Matchings , 1982 .
[35] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[36] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.
[37] D. Chinhyung Cho,et al. On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..
[38] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[39] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[40] Manfred Padberg,et al. On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..
[41] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[42] Laurence A. Wolsey,et al. Uncapacitated lot-sizing: The convex hull of solutions , 1984 .
[43] M. Grötschel,et al. Solving matching problems with linear programming , 1985, Math. Program..
[44] Eugene L. Lawler,et al. A Guided Tour of Combinatorial Optimization , 1985 .
[45] L. Wolsey,et al. Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .
[46] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[47] Michael Jünger,et al. Polyhedral combinatorics and the acyclic subdigraph problem , 1985 .
[48] Martin Grötschel,et al. Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..
[49] Laurence A. Wolsey,et al. Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..
[50] L. Lovász,et al. Annals of Discrete Mathematics , 1986 .
[51] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..
[52] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[53] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[54] Laurence A. Wolsey,et al. Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..
[55] Laurence A. Wolsey,et al. Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..
[56] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[57] ReineltGerhard,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988 .
[58] W. R. Pulleyblank,et al. Forest covers and a polyhedral intersection theorem , 1989, Math. Program..
[59] Yoshiko Wakabayashi,et al. A cutting plane algorithm for a clustering problem , 1989, Math. Program..
[60] Egon Balas,et al. On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} , 1989, Math. Program..
[61] Ali Ridha Mahjoub,et al. Facets of the balanced (acyclic) induced subgraph polytope , 1989, Math. Program..
[62] Antonio Sassano,et al. Facets and lifting procedures for the set covering polytope , 1989, Math. Program..
[63] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..
[64] S. Chopra. On the spanning tree polyhedron , 1989 .
[65] Gérard Cornuéjols,et al. On the 0, 1 facets of the set covering polytope , 1989, Math. Program..
[66] Thomas L. Magnanti,et al. Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..
[67] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[68] Monique Laurent,et al. A generalization of antiwebs to independence systems and their canonical facets , 1989, Math. Program..
[69] M. Goemans. Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds , 1989 .
[70] Martin Grötschel,et al. Facets of the clique partitioning polytope , 1990, Math. Program..
[71] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[72] Thomas L. Magnanti,et al. Capacitated trees, capacitated routing, and associated polyhedra , 1990 .
[73] J. Araque. Lots of combs of different sizes for vehicle routing , 1990 .
[74] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..
[75] Laureano F. Escudero,et al. Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds , 1990 .
[76] Matteo Fischetti,et al. Facets of two Steiner arborescence polyhedra , 1991, Math. Program..
[77] Sungsoo Park,et al. A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..
[78] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[79] Giovanni Rinaldi,et al. The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities , 1991, Math. Program..
[80] Manfred W. Padberg,et al. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..
[81] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[82] Matteo Fischetti,et al. Facets of the Asymmetric Traveling Salesman Polytope , 1991, Math. Oper. Res..
[83] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[84] Antonio Sassano,et al. The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..
[85] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[86] Michel Deza,et al. Facets for the cut cone I , 1992, Math. Program..
[87] Michel Deza,et al. Facets for the cut cone II: Clique-web inequalities , 1992, Math. Program..
[88] Laurence A. Wolsey,et al. Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems , 1992, IPCO.
[89] Martin Grötschel,et al. Clique-Web Facets for Multicut Polytopes , 1992, Math. Oper. Res..
[90] F. B. Shepherd,et al. Formulations for the stable set polytope , 1992 .
[91] G. Nemhauser,et al. A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .
[92] Ali Ridha Mahjoub,et al. On 2-Connected Subgraph Polytopes , 1992, IPCO.
[93] Matteo Fischetti,et al. Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope , 1992, IPCO.
[94] Michel X. Goemans,et al. Polyhedral Description of Trees and Arborescences , 1992, IPCO.
[95] Martin Grötschel,et al. A cutting plane algorithm for the windy postman problem , 1992, Math. Program..
[96] Giovanni Rinaldi,et al. The Crown Inequalities for the Symmetric Traveling Salesman Polytope , 1992, Math. Oper. Res..
[97] Thomas L. Magnanti,et al. A Polyhedral Intersection Theorem for Capacitated Spanning Trees , 1992, Math. Oper. Res..
[98] Denis Naddef. The Binested Inequalities for the Symmetric Traveling Salesman Polytope , 1992, Math. Oper. Res..
[99] John E. Mitchell,et al. A primal-dual interior point cutting plane method for the linear ordering problem , 1992 .
[100] Martin Grötschel,et al. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..
[101] M. R. Rao,et al. Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..
[102] László Lovász,et al. The Generalized Basis Reduction Algorithm , 1990, Math. Oper. Res..
[103] Egon Balas,et al. The Fixed-Outdegree 1-Arborescence Polytope , 1992, Math. Oper. Res..
[104] M. R. Rao,et al. The partition problem , 1993, Math. Program..
[105] Jean-Maurice Clochard,et al. Using path inequalities in a branch and cut code for the symmetric traveling salesman problem , 1993, IPCO.
[106] Laurence A. Wolsey,et al. Algorithms and reformulations for lot sizing problems , 1994, Combinatorial Optimization.
[107] M. Stoer. Design of Survivable Networks , 1993 .
[108] David Shallcross,et al. An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming , 1993, INFORMS J. Comput..
[109] Egon Balas,et al. Polyhedral methods for the maximum clique problem , 1994, Cliques, Coloring, and Satisfiability.
[110] Gérard Cornuéjols,et al. Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..
[111] M. Padberg,et al. Solving airline crew scheduling problems by branch-and-cut , 1993 .
[112] Michael Jünger,et al. Solving the maximum weight planar subgraph , 1993, IPCO.
[113] William R. Pulleyblank,et al. Formulations for the stable set polytope of a claw-free graph , 1993, IPCO.
[114] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[115] Michael Jünger,et al. Practical problem solving with cutting plane algorithms in combinatorialoptimization , 1993, Combinatorial Optimization.
[116] Polyhedral results for the uncapacitated facility location problem: Lifting and separation , 1994 .
[117] C. P. Van. Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs , 1994 .
[118] Michael Jünger,et al. Provably good solutions for the traveling salesman problem , 1994, Math. Methods Oper. Res..
[119] M. R. Rao,et al. The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..
[120] Jon Lee,et al. More facets from fences for linear ordering and acyclic subgraph polytopes , 1994, Discret. Appl. Math..
[121] E. Andrew Boyd,et al. Fenchel Cutting Planes for Integer Programs , 1994, Oper. Res..
[122] Janny Leung. Polyhedral structure and properties of a model for layout design , 1994 .
[123] Albert P. M. Wagelmans,et al. Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs , 1992, SIAM J. Discret. Math..
[124] M. R. Rao,et al. The Steiner tree problem II: Properties and classes of facets , 1994, Math. Program..
[125] George L. Nemhauser,et al. Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..
[126] Martin W. P. Savelsbergh,et al. Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..
[127] Cid C. de Souza,et al. Some New Classes of Facets for the Equicut Polytope , 1995, Discret. Appl. Math..
[128] Hoesel van Cpm,et al. Polyhedral techniques in combinatorial optimization I: theory , 1996 .
[129] Rekha R. Thomas. A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..
[130] Martin Grötschel,et al. Routing in grid graphs by cutting planes , 1995, Math. Methods Oper. Res..
[131] Karen Aardal,et al. Polyhedral Techniques in Combinatorial Optimization , 1995 .
[132] Egon Balas,et al. The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..
[133] Martin W. P. Savelsbergh,et al. Sequence Independent Lifting of Cover Inequalities , 1995, IPCO.
[134] Rekha R. Thomas,et al. An algebraic geometry algorithm for scheduling in presence of setups and correlated demands , 1995, Math. Program..
[135] Laurence A. Wolsey,et al. Capacitated Facility Location: Valid Inequalities and Facets , 1995, Math. Oper. Res..
[136] Michel X. Goemans,et al. Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..
[137] George L. Nemhauser,et al. The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..
[138] Matteo Fischetti,et al. {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..
[139] John E. Mitchell,et al. Solving real-world linear ordering problems using a primal-dual interior point cutting plane method , 1996, Ann. Oper. Res..
[140] Oktay Günlük,et al. Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..
[141] Laurence A. Wolsey,et al. An exact algorithm for IP column generation , 1994, Oper. Res. Lett..
[142] Abilio Lucena,et al. Branch and cut algorithms , 1996 .
[143] Martin Grötschel,et al. Packing Steiner trees: polyhedral investigations , 1996, Math. Program..
[144] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[145] Karen Aardal,et al. On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..
[146] Éva Tardos,et al. Separating Maximally Violated Comb Inequalities in Planar Graphs , 1996, IPCO.
[147] Michel X. Goemans,et al. The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown , 1996, IPCO.
[148] Leslie Hall,et al. Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem , 1996, INFORMS J. Comput..
[149] Rudolf Müller,et al. Transitive Packing , 1996, IPCO.
[150] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[151] Robert Carr,et al. Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time , 1997, Math. Oper. Res..
[152] Robert Weismantel,et al. On the 0/1 knapsack polytope , 1997, Math. Program..
[153] Rekha R. Thomas,et al. Variation of cost functions in integer programming , 1997, Math. Program..
[154] Petra Bauer. The Circuit Polytope: Facets , 1997, Math. Oper. Res..
[155] Giovanni Rinaldi,et al. A branch-and-cut algorithm for the equicut problem , 1997, Math. Program..
[156] Martin Grötschel,et al. The steiner tree packing problem in VLSI design , 1997, Math. Program..
[157] Eddie Cheng,et al. Wheel inequalities for stable set polytopes , 1997, Math. Program..
[158] Robert Weismantel,et al. The Sequential Knapsack Polytope , 1998, SIAM J. Optim..
[159] Laurence A. Wolsey,et al. The node capacitated graph partitioning problem: A computational study , 1998, Math. Program..
[160] Oktay Günlük,et al. Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..
[161] Egon Balas,et al. Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes , 1998 .
[162] Karen Aardal,et al. Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..
[163] Miguel Constantino,et al. Lower Bounds in Lot-Sizing Models: A Polyhedral Study , 1998, Math. Oper. Res..
[164] Laurence A. Wolsey,et al. Cutting planes for integer programs with general integer variables , 1998, Math. Program..
[165] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[166] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.
[167] ON THE SET COVERING POLYTOPE : II . LIFTING THE FACETS ' I WITH COEFFICIENTS IN { 0 , 1 , 2 ) by 0 N , .