Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^6: Travelling problem

by educated_foo (Vicar)
on Dec 22, 2013 at 13:40 UTC ( #1068097=note: print w/replies, xml ) Need Help??

in reply to Re^5: Travelling problem
in thread Travelling problem

I wasn't aware that the "NP-heuristics" are able to guaranty such good results like Christofides does.
I only knew because I took a course from a guy (EDIT: Bill Cook, who literally wrote the book on the TSP) whose research specialty was the TSP. Another cool thing about it is that you can find good lower bounds on the length (based on the minimum spanning tree length), so you can use those plus a heuristic (i.e. upper bound) to iteratively find the true solution.

I have no idea whether "good-enough" solutions to the TSP can be translated to "good-enough" solutions to other NP-complete problems, but that's an interesting thought. Many of the ways of reducing one NP-complete problem to another are fairly bizarre, so solution quality might not translate.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1068097]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2021-10-22 10:40 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (85 votes). Check out past polls.