Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


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

Topic: Is this "travelling salesman problem" version known?
Replies: 5   Last Post: Mar 16, 2004 3:57 PM

Advanced Search

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

Posts: 11
Registered: 12/13/04
Is this "travelling salesman problem" version known?
Posted: Mar 10, 2004 3:25 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


(was: How are these "minimal paths" called?)
Since only a few knew what I'm talking about, I'll reformulate the
problem and hope for a better understanding.

Let V be be set of cities, E (containing some two-element sets of
elements of V) is the set of connections between some cities, all these
connectons have cost 1. Other connections (i.e. not in E) cost infinity.
(I.e. the salesman goes only through the connections listed in E). Let W
be a subset of V.
Questions: (1) Find a shortest path which goes at least once through
each city in W (and is allowed to visit cities in V\W)? (2) What is the
cost of such shortest path?

--
Best regards,
Alex.

PS. To email me, remove "loeschedies" from the email address given.




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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.