A note on the polytope of bipartite TSP
暂无分享,去创建一个
[1] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[2] K. HajiehJabbari. Optimizing the Route of an Assembly Arm , 2011 .
[3] David R. Karger,et al. Minimum cuts in near-linear time , 1998, JACM.
[4] James B. Orlin,et al. A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.
[5] Denis Naddef,et al. Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP , 2007 .
[6] Andreas Baltz,et al. Approximation algorithms for the Euclidean bipartite TSP , 2005, Oper. Res. Lett..
[7] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[8] Anand Srivastav,et al. Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract) , 2001, Electron. Notes Discret. Math..
[9] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.
[10] Denis Naddef,et al. Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation , 2002, Math. Program..
[11] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..