The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: traveling salesmen problem
Replies: 4   Last Post: Oct 21, 2012 12:37 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 65
Registered: 12/13/04
traveling salesmen problem
Posted: Oct 18, 2012 10:17 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

this is a variation of the traveling salesman problem which I think
is more practical and more important. Maybe it is known under
a different name ?
In the original problem, suppose (equivalent descriptions)
the salesman is always allowed
to return to a previously visited city at zero cost
at which time the cities visited between these 2
events are removed from the list
Or the transportation of the thing that he sells is much more
expensive than transporting himself.
Or he can hire a sub-salesman at any point who visits
one remote region while he visits the rest. The sub-salesman
needn't return, just deliver the product and can recruit
sub-sub-salesmen etc
or connect every city from a list with the oil-source
by a pipeline and minimize the total length of pipelines
or trying to sort genetic sequences
into an evolution tree : giving n sequences with known mutual
genetic distances, find a tree whose vertices are the sequences
such that the sum of the distances of joined vertices is minimal.

is that problem known ? What's the name,
where to find something about it ?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.