Computer Science – Computational Complexity
Scientific paper
2007-02-23
Computer Science
Computational Complexity
4 pages, 4 figures
Scientific paper
This paper describes TSP exact solution of polynomial complexity. It is
considered properties of proposed method. Effectiveness of proposed solution is
illustrated by outcomes of computer modeling.
No associations
LandOfFree
Fast Exact Method for Solving the Travelling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast Exact Method for Solving the Travelling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Exact Method for Solving the Travelling Salesman Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-691909