An approximate method to compute a sparse graph for traveling salesman problem

Expert Systems with Applications

Volumn 42, Issue 12, 2015, Pages 5150-5162

  Wang, Yong ^a  

^a NORTH CHINA ELECTRIC POWER UNIVERSITY   (China)

Author keywords

Frequency graph; Frequency threshold; Optimal k vertex path; Sparse graph; Traveling salesman problem

Indexed keywords

APPROXIMATION THEORY; GRAPHIC METHODS; HAMILTONIANS; INFORMATION DISSEMINATION; TOPOLOGY; TRAVELING SALESMAN PROBLEM;

APPROXIMATE METHODS; BOUNDED DEGREE GRAPHS; FREQUENCY GRAPH; FREQUENCY THRESHOLD; NATURAL LOGARITHMS; SPARSE GRAPHS; TOPOLOGICAL STRUCTURE; VERTEX PATH;

GRAPH THEORY;

EID: 84939960123     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2015.02.037     Document Type: Article

References (21)

1. Andreas, B. (2010). Determinant sums for undirected Hamiltonicity. In Proceedings of the 2010 IEEE 51st annual symposium on foundations of computer science, Las Vegas, USA, 23-26 Oct. 2010 (pp. 173-182).
2. D. Applegate, R. Bixby, V. Chvátal, and W. Cook Implementing the Dantzig-Fulkerson-Johnson algorithm for large scale traveling salesman problems Mathematical Programming Series B 97 1-2 2003 91 153
3. D. Applegate, R. Bixby, V. Chvátal, and W. Cook The traveling salesman problem: A computational study 2006 Princeton University Press Princeton 978-0-691-12993-8
4. D. Applegate, R. Bixby, V. Chvátal, W. Cook, D.G. Espinoza, and M. Goycoolea Certification of an optimal TSP tour through 85900 cities Operations Research Letters 37 1 2009 11 15
5. D. Berend, S.S. Skiena, and Y. Twitto Combinatorial dominance guarantees for problems with infeasible solutions ACM Transactions on Algorithms 5 1 2008 Article 8, Publication date: November 2008
6. A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto The travelling salesman problem in bounded degree graphs Lecture Notes in Computer Science 5125 2008 198 209
7. B.W. Douglas Introduction to graph theory section ed. 2006 Pearson Education Asia Limited and China Machine Press Bejing (pp.75-76)
8. D. Eppstein The traveling salesman problem for cubic graphs Journal of Graph Algorithms and Applications 11 1 2007 61 81
9. L. Gouveia, and S. Voß A classification of formulations for the (time-dependent) traveling salesman problem European Journal of Operational Research 83 1 1995 69 82
10. G. Heidi On the number of Hamilton cycles in bounded degree graphs 2007 ETH Zurich Switzerland
11. M. Held, and R. Karp A dynamic programming approach to sequencing problems J. Soc. Ind. Appl. Math. 10 1 1962 196 210
12. R. Impagliazzo, R. Paturi, and F. Zane Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63 4 2001 512 530
13. D.S. Johnson, and L.A. McGeoch The traveling salesman problem and its variations Combinatorial optimization Vol. 12 2004 Springer Press London (pp. 445-487)
14. R. Karp On the computational complexity of combinatorial problems Networks (USA) 5 1 1975 45 68
15. E.D. Klerk, and C. Dobre A comparison of lower bounds for the symmetric circulant traveling salesman problem Discrete Applied Mathematics 159 16 2011 1815 1826
16. M.S. Levine Finding the right cutting planes for the TSP Journal of Experimental Algorithmics 5 6 2000 1 16
17. Oliver, I. M.; Smith, D. J.; Holland, J. R. C. (1987). A study of permutation crossover operators on the travelling salesman problem. In Proceedings of the second international conference on genetic algorithms on genetic algorithms and their application (pp. 224-230).
18. G. Reinelt TSPLIB - a traveling salesman problem library ORSA Journal on Computing 3 4 1991 376 384
19. Sharir, M.; Welzl, E. (2006). On the number of crossing-free matchings, (cycles, and partitions). In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 860-869).
20. Wang, Y. (2012). The frequency graph for the traveling salesman problem. In ICECECE 2012, Bali, Indonesia, Oct. 24-25, 2012 (pp. 1019-1022).
21. Wang, Y. (2013). A representation model for TSP. In 2013 IEEE 10th international conference on high-performance computing and communications 2013 IEEE international conference on embedded and ubiquitous computing, Zhangjiajie, China, Nov. 13-15 2013 (pp. 204-209).