Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
暂无分享,去创建一个
[1] Manfred W. Padberg,et al. A branch-and-cut approach to a traveling salesman problem with side constraints , 1989 .
[2] Toshihide Ibaraki,et al. Implementing an efficient minimum capacity cut algorithm , 1994, Math. Program..
[3] Giovanni Rinaldi,et al. The Crown Inequalities for the Symmetric Traveling Salesman Polytope , 1992, Math. Oper. Res..
[4] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[5] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[6] William H. Cunningham,et al. Small Travelling Salesman Polytopes , 1991, Math. Oper. Res..
[7] Giovanni Rinaldi,et al. An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..
[8] Gerhard Reinelt,et al. Traveling salesman problem , 2012 .
[9] D. Karger,et al. Random sampling in graph optimization problems , 1995 .
[10] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..
[11] Toshihide Ibaraki,et al. Computing All Small Cuts in Undirected Networks , 1994, ISAAC.
[12] Denis Naddef. The Binested Inequalities for the Symmetric Traveling Salesman Polytope , 1992, Math. Oper. Res..
[13] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .