![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 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](https://www.pdfsearch.io/img/b09abd1c89718810874a58388e62104d.jpg)
| Document Date: 2003-06-11 09:35:55 Open Document File Size: 140,13 KBShare 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 |