Criss-cross algorithm: Difference between revisions

Revision as of 00:18, 29 December 2023

Revision as of 13:07, 9 January 2024

Line 1:

{{Short description|Method for mathematical optimization}}

{{About|an algorithm for mathematical optimization||Criss-cross (disambiguation){{!}}Criss-cross}}

{{Use dmy dates|date=DecemberJanuary 20132024}}

<!-- {{Context|date=May 2012}} -->

[[File:Unitcube.svg|thumb|right|alt=A three-dimensional cube|The criss-cross algorithm visits all&nbsp;8 corners of the [[Klee–Minty cube]] in the worst case. It visits&nbsp;3 additional corners on&nbsp;average. The Klee–Minty cube is a perturbation of the cube shown here.]]

Line 73:

==Notes==

{{Reflist}}

<references/>

==References==