Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem)
Jump to navigation
Jump to search
Time Complexity
$exp(V)$
Space Complexity
$O(V^{4})$ words
(Derived: V^2 + 2V constraints on V^2 variables, most integer programs use space of O(nm) where n=#vars and m=#constraints)
Description
ILP formulation
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1960