Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference31 articles.
1. D. Applegate, R. Bixby, V. Chvátal and W. Cook, “Finding cuts in the TSP,” DIMACS Technical Report 95-05, Rutgers University, New Brunswick, NJ, 1995.
2. C. Berge,Graphes et Hypergraphes (Dunod, Paris, 1970).
3. S. Boyd and W. Cunningham, “Small traveling salesman polytopes,”Mathematics of Operations Research 16 (1991) 259–271.
4. S.C. Boyd and W.R. Pulleyblank, “Optimizing over the subtour polytope of the travelling salesman problem,”Mathematical Programming 49 (1991) 163–187.
5. V. Chvátal, “Edmonds polytopes and weakly Hamiltonian graphs,”Mathematical Programming 5 (1973) 29–40.
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献