Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3411:34, 15 February 2023‎ Admin talk contribs‎ 426 bytes +426‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Miller-Tucker-Zemlin_(MTZ)_formulation_(Minimum_TSP_The_Traveling-Salesman_Problem)"