# Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem)

Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://dl.acm.org/doi/10.1145/321043.321046")

## 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