Question

State Traveling Sales Persons problem. Comment on the nature of solution to the problem.

 

03 Nov 2017
Answer :
Word Count : 401

The Travelling Salesman Problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.

The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of

______ _______ _______ ___ __________ ________ ___.
_________ _______ ________ _________ _____ __________ ______ ________.
____ ______ ___ _____ ____ ___ ________ ________ ______ ____.
____ __________ ____ _______ ______ ___ __________ _________ ______ ____.
_____ _____ __________ ___ _______ _____ _________ ___ __________ ____ _______.
______ _______ ____ ________ ________ __________ __________ _________ ___ ____ _________.
______ __________ ______ __________ _______ ________ _______ _______ _______.
______ ______ ___ ________ _____ __________ ________ __________ _____ ________.
____ _____ ____ _______ _________.
_____ ________ _____ ___ ______ ____ _______ _______ ______.
______ ______ ____ ______ ________ ______ ________ ________ __________.
__________ ___ __________ _________ _______.
____ _______ _______ ___ _______ _______.
___ ___ _____ ____ ______ _______ _______ _______ ___ ___ _______.
______ ______ ___ ______ ____ _____ __________ ____ ____ _____ _______.
___ ______ ___ ___ ___ _________.
______ ____ _____ ______ _______ __________ ___ ____ _________.
_________ ______ ________ ______ _______ ______.
_________ ______ ___ ____ _________ ___ ______ ______.
______ ________ ___ ____ ________ ____ _______ _____ ______ _________ __________ ___.
____ _______ __________ ____ ______ ____ _____ _____ _____.
_____ ______ _____ ______ ___ ______ ________ _________ _______ ___.
________ ____ ________ ___ __________ __________ _______ __________ ________ _______ ____ _______.
______ ______ ______ _____ _______.
_______ _____ _________ ________ ____ _________ _________ ____.
_______ ____ _________ _______ ______ ______ ___ _____.
__________ __________ ___ ______ _______ _______.
________ ___ _____ ________ _______ _______ _________.
________ _____ ___ ______ ____ ______.
________ ____ __________ _____ ___ _____ _______ __________ ____ ___.
___ __________ __________ ____ ____ ___ ______ _________ _____ _________.
______ _____ __________ ________ _____.
_____ ___ ______ ____ ___ _____ ___ ___ ________ ___ ______.
_______ _______ ____ ________ ________ __________ _________ _________.
______ ___ _____ _____ _____ _____ _______.
___ ______ ________ __________ ____ _______.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MCS 31 2011 - State Traveling Sales Persons problem. Comment on the nature of soluti | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→