Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem)

From Algorithm Wiki
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.674}^V E^{2})$ == Space Complexity == $O({2}^V)$ words (http://web.ist.utl.pt/~ist11038/CD_Casquilho/TSP1992EJOR_Laporte.pdf) == Description == ILP formulation == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1954 == Reference == https://doi.org/10.1287/opre.2.4.393")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({1.674}^V E^{2})$

Space Complexity

$O({2}^V)$ words

(http://web.ist.utl.pt/~ist11038/CD_Casquilho/TSP1992EJOR_Laporte.pdf)

Description

ILP formulation

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1954

Reference

https://doi.org/10.1287/opre.2.4.393

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dantzig-Fulkerson-Johnson_(DFJ)_formulation_(Minimum_TSP_The_Traveling-Salesman_Problem)&oldid=44496"