× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
a
5
k
5
c
5
B
5
l
5
C
4
s
4
a
4
t
4
i
4
r
4
r
4
This topic contains 1 attachment.
Home Q & A Board Science-Related Homework Help Mathematics
New Topic  
Anonymous peoplemover
wrote...
A year ago
Explain why using a "brute force" method to identify the shortest route in a traveling salesman problem with 18 cities is problematic.
Read 81 times
3 Replies

Related Topics

Replies
wrote...
#1
Staff Member
A year ago
I believe that's no different than taking 18!

That amounts to 6.4*10^15 routes; hence, brute force is not practical
- Master of Science in Biology
- Bachelor of Science
Anonymous
wrote...
#2
A year ago
I think you forgot to divide by 2.

\(\frac{n!}{2}\)
 Attached file 
Thumbnail(s):
You must login or register to gain access to this attachment.
wrote...
#3
Staff Member
A year ago
Yes, that's the number of route pairs, you divide by n!/2

This is obviously not a practical way, whether it be a computer or a human
- Master of Science in Biology
- Bachelor of Science
New Topic      
Quick Reply
Explore
Post your homework questions and get free online help from our incredible volunteers
  1257 People Browsing
 124 Signed Up Today
Start New Topic Take the Tour CoursesNew Study Tools Topics Trending Browse by Textbook
Related Images
  
 291
  
 156
  
 788
Your Opinion
Which of the following is the best resource to supplement your studies:
Votes: 249
Previous poll results: How often do you eat-out per week?