info@avatto.com
+91-9920808017
0. Which of the following statements is/are true about ‘Traveling Salesman problem’ (TSP)?
It is an NP-hard problem in combinatorial optimisation
There aren’t any exact algorithms known to solve TSP therefore we use heuristic techniques.
Ant colony optimisation can generate “good solutions” to TSP using a simulation of an ant colony
All of the above
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
