You can solve the traveling salesman problem by selecting a cycle with the lowest cost.
True or False
False. The traveling salesman problems is classified as an NP-hard problem in combinatorial optimization; simply minimizing the cost will not necessarily optimize the path of travel.
Content will be erased after question is completed.
Enter the email address associated with your account, and we will email you a link to reset your password.
Forgot your password?