Content deleted Content added
→References: Roos, and tweak RTR |
→Oriented matroids: <ref>{{harvtxt|Roos|1990}}</ref> |
||
Line 12:
|pages=417–479|doi=10.1017/CBO9780511586507|MR=1744046}}</ref>
Like the simplex algorithm of Dantzig, the criss-cross algorithm is not a [[polynomial-time algorithm]] for linear programming. The original criss-cross algorithm of Terlaky visits all the 2<sup>''D''</sup> corners of a (perturbed) cube in dimension ''D'', according to a paper of Roos (which modifies the Klee-Minty construction of a cube on which the simplex algorithm takes 2<sup>''D''</sup> steps.<ref name="FukudaTerlaky"/><ref>{{harvtxt|Roos|1990}}</ref>
==Summary==
| |||