Као и Симплекс, и овај алгоритам се креће између базних решења. Али criss-cross алгоритам не мора да задржи допустивост база, већ може да оде и на недопустиав базна решења. Оавј алгоритам је као и Симплекс, експоненцијане сложености у најгорем случају.<ref name="FukudaTerlaky">{{harvnb|Fukuda|Terlaky|1997}}: {{cite article|first1first=Komei|last1last=Fukuda|first2=Tamás|last2=Terlaky|title=Criss-cross methods: A fresh view on pivot algorithms |journal=Mathematical Programming: Series B|volume=79|number=1—3|editor=Thomas M. Liebling |editor2 = Dominique de Werra |publisher=North-Holland Publishing Co. |location=Amsterdam|year=1997|doi=10.1007/BF02614325|MR=1464775|pages=369-395}}</ref><ref name="Roos" >{{harvnb|Roos|1990}}: {{cite journal|last=Roos|first=C.|title=An exponential example for Terlaky's pivoting rule for the criss-cross simplex method|journal=Mathematical Programming|volume=46|year=1990|series=Series A|doi=10.1007/BF01585729|mr=1045573|ref=harv|issue=1|pages=79-84}}</ref>
==== Серангов алгоритам ====
Ред 393:
* Dantzig, G.B.: "Linear programming and extensions", 1998. {{page1|location=|publisher=Princeton University Press|year=|isbn=9780691059136 |pages=}}
* Frederick, S.,H.,Lieberman, G.J. "Introduction to Operations Research, 6th edition, McGraw Hill, 1995
* {{Cite book | ref= harv|last1last=Gondzio|first1first=Jacek|last2=Terlaky|first2=Tamás|chapter=3 A computational view of interior point methods|mr=1438311|title=Advances in linear and integer programming|editor=J. E. Beasley|location=New York|publisher=Oxford University Press|year=1996|series=Oxford Lecture Series in Mathematics and its Applications|volume=4|url=http://www.maths.ed.ac.uk/~gondzio/CV/oxford.ps|id=[http://www.maths.ed.ac.uk/~gondzio/CV/oxford.ps Postscript file at website of Gondzio] and at McMaster University website of Terlaky |pages=103-144}}
