On the separation of maximally violated mod-k cuts
暂无分享,去创建一个
[1] M. Padberg,et al. On the symmetric travelling salesman problem II , 1979 .
[2] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[3] Éva Tardos,et al. Separating Maximally Violated Comb Inequalities in Planar Graphs , 1996, IPCO.
[4] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[5] Matteo Fischetti,et al. Facets of the Asymmetric Traveling Salesman Polytope , 1991, Math. Oper. Res..
[6] Michael Jünger,et al. A complete description of the traveling salesman polytope on 8 nodes , 1991, Oper. Res. Lett..
[7] Gerhard Reinelt,et al. Traveling salesman problem , 2012 .
[8] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[9] Matteo Fischetti,et al. On the Separation of Maximally Violated mod-k Cuts , 1999, IPCO.
[10] Adam N. Letchford. Polyhedral Results for Some Constrained Arc-Routing Problems , 1996 .
[11] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[12] Matteo Fischetti,et al. Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope , 1995, Discret. Appl. Math..
[13] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[14] Giovanni Rinaldi,et al. The graphical relaxation: A new framework for the symmetric traveling salesman polytope , 1993, Math. Program..
[15] Egon Balas,et al. The Fixed-Outdegree 1-Arborescence Polytope , 1992, Math. Oper. Res..
[16] Matteo Fischetti,et al. Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope , 1992, IPCO.
[17] Adam N. Letchford. Separating a Superclass of Comb Inequalities in Planar Graphs , 2000, Math. Oper. Res..
[18] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[19] David Applegate,et al. Finding Cuts in the TSP (A preliminary report) , 1995 .
[20] George B. Dantzig,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..
[21] Lisa Fleischer. Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time , 1998, IPCO.
[22] Robert D. Carr. Separating Clique Tree and Bipartition Inequalities in Polynominal Time , 1995, IPCO.
[23] Matteo Fischetti,et al. {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..
[24] Egon Balas,et al. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets , 1993, Math. Program..
[25] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[26] Alberto Caprara,et al. F0; 1 2 G-chv Atal-gomory Cuts , 1995 .
[27] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[28] Milind Dawande,et al. Combining and Strengthening Gomory Cuts , 1995, IPCO.
[29] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[30] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .