Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Traveling Salesman Problem

Name: Minomol 2011-02-02 15:26

Hey folks, I have a simple question:

Can any circular graph(undirected, weighted) be used for the travelling salesman problem, or are there any further requirements?

Thanks.

Name: Anonymous 2011-02-02 15:31

bump

Name: Anonymous 2011-02-02 15:40

>>2
What are you, autistic?

OKAY

First, sage your posts like we all do.
Second, are you autistic? It's been five minutes.
Third, this is not /b/. Or /g/ for that matter.

Welcome to /prog/.

Name: Anonymous 2011-02-02 15:50

THE FORCED NP-COMPLETENESS OF PROBLEMS

Name: Anonymous 2011-02-02 15:59

>>1
Forget it, it's NP-compl-Wait, it really is!

Traveling Salesman Problem

1 Name: Minomol 2011-02-02 15:26

2 Name: Anonymous 2011-02-02 15:31

3 Name: Anonymous 2011-02-02 15:40

4 Name: Anonymous 2011-02-02 15:50

5 Name: Anonymous 2011-02-02 15:59

Name: Minomol 2011-02-02 15:26

Name: Anonymous 2011-02-02 15:31

Name: Anonymous 2011-02-02 15:40

Name: Anonymous 2011-02-02 15:50

Name: Anonymous 2011-02-02 15:59