× Didn't find what you were looking for? Ask a question
Top Posters
Since Sunday
5
o
5
4
m
4
b
4
x
4
a
4
l
4
t
4
S
4
m
3
s
3
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 76 times
3 Replies

Related Topics

Replies
wrote...
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...
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...
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      
Explore
Post your homework questions and get free online help from our incredible volunteers
  1130 People Browsing
Related Images
  
 200
  
 51
  
 53