TSPLIB (Minimum TSP The Traveling-Salesman Problem)

From Algorithm Wiki

Revision as of 08:43, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({2}^V \log E)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

https://pubsonline-informs-org.ezproxy.canberra.edu.au/doi/abs/10.1287/ijoc.3.4.376

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=TSPLIB_(Minimum_TSP_The_Traveling-Salesman_Problem)&oldid=47418"