Terlaky's Criss-cross algorithm ( Linear Programming)

From Algorithm Wiki

Revision as of 08:33, 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}^n*poly(n, m))$

Space Complexity

$O(nm)$ words

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1985

Reference

-

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Terlaky%27s_Criss-cross_algorithm_(_Linear_Programming)&oldid=47332"