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
Re: Is this "travelling salesman problem" version known?
Posted: Mar 12, 2004 9:33 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

anonymous@mathforum.org wrote:
> If you are required to return to the starting point,
> then this is the "Hamiltonian cycle" problem,
> which is knownto be NP-hard.

No. The path is allowed to be open (and in the problem I'm working on,
it is always open except we have only one city)

I din't even see a proof of NP-hardness for the "open path" version of
TSP. Here help is appreciated too.

Best regards,

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]

© The Math Forum 1994-2015. All Rights Reserved.