Skip to main content
Article thumbnail
Location of Repository

Software for solving of TSP

By Roman Lukatsky and Vladimir Rybinkin

Abstract

Abstract:- This paper is devoted to investigation of problems of discrete or combinatorial optimization on the example of symmetric travelling salesman problem. A parametric algorithm for solving of TSP from very fast to exact, including the version with mobile nodes is offered. The developed software was tested by solving of TSPs that best-known solutions are already known. Key-Words:- Travelling Salesman Problem, TSP, DBMS, Graph

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.416.3773
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.wseas.us/e-library/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.