Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Operations research / Mathematical optimization / Spanning tree / Travelling salesman problem / Minimum spanning tree / NP-hard / NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics


The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]
Add to Reading List

Document Date: 2003-06-11 09:35:55

Open Document

File Size: 140,13 KB

Share Result on Facebook

/

Facility

Computer Science Department Rochester Institute of Technology / /

Organization

Rochester Institute of Technology / Rochester / /

Person

Peter G. Anderson / /

Position

Traveling Salesman / salesman / /

ProgrammingLanguage

J / TSP / /

URL

http /

SocialTag