Separating Maximally Violated Comb Inequalities in Planar Graphs
暂无分享,去创建一个
[1] Martin Grötschel,et al. On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..
[2] Lisa Fleischer. Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time , 1998, IPCO.
[3] David Applegate,et al. Finding Cuts in the TSP (A preliminary report) , 1995 .
[4] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[6] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..
[7] James B. Orlin,et al. A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.
[8] András A. Benczúr,et al. Cut structures and randomized algorithms in edge-connectivity problems , 1997 .
[9] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[10] Michel X. Goemans,et al. 2-Change for k-connected networks , 1991, Oper. Res. Lett..
[11] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[12] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[13] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[14] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[15] E. BixbyR.. The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n-Bonds , 1975 .
[16] András A. Benczúr,et al. Augmenting undirected connectivity in RNC and in randomized Õ(n3) time , 1994, STOC '94.
[17] Robert Carr. Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time , 1997, Math. Oper. Res..
[18] Robert D. Carr. Separating Clique Tree and Bipartition Inequalities in Polynominal Time , 1995, IPCO.
[19] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[20] Harold N. Gabow,et al. Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[21] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[22] David P. Williamson. ANALYSIS OF THE HELD-KARP HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM , 1990 .
[23] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[24] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[25] Martin Grötschel,et al. On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .
[26] Vijay V. Vazirani,et al. Representing and Enumerating Edge Connectivity Cuts in RNC , 1991, WADS.
[27] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[28] E. A. Timofeev,et al. Efficient algorithm for finding all minimal edge cuts of a nonoriented graph , 1986 .