Criss-cross algorithm: Difference between revisions

Revision as of 15:41, 25 October 2020

Revision as of 15:45, 25 October 2020

Line 76:

==References==

* {{cite journal |first1=David |last1=Avis |first2=Komei |last2=Fukuda |authorlink2=Komei Fukuda |authorlink1=David Avis |title=A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra|journal=[[Discrete and Computational Geometry]] |volume=8 |date=December 1992 |pages=295–313 |doi=10.1007/BF02293050 |issue=ACM Symposium on Computational Geometry (North Conway, NH, 1991) number 1 |mr=1174359|ref=harv|doi-access=free }}

* {{cite journal|first1=Zsolt|last1=Csizmadia|first2=Tibor|last2=Illés|title=New criss-cross type algorithms for linear complementarity problems with sufficient matrices|journal=Optimization Methods and Software|volume=21|year=2006|number=2|pages=247–266|doi=10.1080/10556780500095009|

url=http://www.cs.elte.hu/opres/orr/download/ORR03_1.pdf|format=pdf<!--|eprint=http://www.tandfonline.com/doi/pdf/10.1080/10556780500095009--> |mr=2195759|ref=harv}}

* {{cite journal|last1=Fukuda|first1=Komei|authorlink1=Komei Fukuda|last2=Namiki|first2=Makoto|title=On extremal behaviors of Murty's least index method|journal=Mathematical Programming|date=March 1994|pages=365–370|volume=64|number=1|doi=10.1007/BF01582581|ref=harv|mr=1286455}}

* {{cite journal|first1=Komei|last1=Fukuda| authorlink1=Komei Fukuda |first2=Tamás|last2=Terlaky| authorlink2=Tamás Terlaky |title=Criss-cross methods: A fresh view on pivot algorithms |journal=Mathematical Programming, Series B|volume=79|pages=369–395|issue=Papers from the&nbsp; 16th International Symposium on Mathematical Programming held in Lausanne,&nbsp; 1997, number 1–3 |editor1-first=Thomas&nbsp; M.|editor1-last=Liebling|editor2-first=Dominique|editor2-last=de&nbsp; Werra|year=1997|doi=10.1007/BF02614325|mr=1464775|ref=harv|id=[http://www.cas.mcmaster.ca/~terlaky/files/crisscross.ps Postscript preprint]|citeseerx=10.1.1.36.9373}}

* {{cite journal|first1=D.|last1=den&nbsp; Hertog|first2=C.|last2=Roos|first3=T.|last3=Terlaky|title=The linear complementarity problem, sufficient matrices, and the criss-cross method|journal=Linear Algebra and Its Applications|volume=187|date=1 July 1993|pages=1–14|url=http://core.ac.uk/download/pdf/6714737.pdf|doi=10.1016/0024-3795(93)90124-7|ref=harv|mr=1221693}}

* {{<!-- citation -->cite journal|title=The finite criss-cross method for hyperbolic programming|journal=European Journal of Operational Research|volume=114|number=1|

pages=198–214|year=1999|<!-- |issn=0377-2217 -->|doi=10.1016/S0377-2217(98)00049-6|url=http://www.sciencedirect.com/science/article/B6VCT-3W3DFHB-M/2/4b0e2fcfc2a71e8c14c61640b32e805a

|first1=Tibor|last1=Illés|first2=Ákos|last2=Szirmai|first3=Tamás|last3=Terlaky|zbl=0953.90055|id=[http://www.cas.mcmaster.ca/~terlaky/files/dut-twi-96-103.ps.gz Postscript preprint]|ref=harv}}

*{{cite journal|first1=Emil|last1=Klafszky|first2=Tamás|last2=Terlaky|title=The role of pivoting in proving some fundamental theorems of linear algebra|journal=Linear Algebra and Its Applications|volume=151|date=June 1991|pages=97–118|doi=10.1016/0024-3795(91)90356-2|url=http://www.cas.mcmaster.ca/~terlaky/files/pivot-la.ps|format=postscript|ref=harv|mr=1102142|access-date=4 August 2011|archive-url=https://web.archive.org/web/20110927061207/http://www.cas.mcmaster.ca/~terlaky/files/pivot-la.ps|archive-date=27 September 2011|url-status=dead|doi-access=free}}

* {{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|number=1|series=Series&nbsp; A|pages=79–84|doi=10.1007/BF01585729|mr=1045573|ref=harv|}}<!-- Google scholar reported no free versions -->}}

* {{cite journal|last=Terlaky|first=T.|title=A convergent criss-cross method|journal=Optimization: A Journal of Mathematical Programming and Operations Research|volume=16|year=1985|number=5|pages=683–690|issn=0233-1934|doi=10.1080/02331938508843067|ref=harv|mr=798939|}}<!-- Google scholar reported no free versions -->}}

* {{cite journal|last=Terlaky|first=Tamás|authorlink=Tamás Terlaky|title=A finite crisscross method for oriented matroids|volume=42|year=1987|number=3|pages=319–327|journal=Journal of Combinatorial Theory|series=Series&nbsp; B|issn=0095-8956|doi=10.1016/0095-8956(87)90049-9|mr=888684|ref=harv|}}<!-- Google scholar reported no free versions -->}}

* {{cite journal|last1=Terlaky|first1=Tamás| authorlink1=Tamás Terlaky |last2=Zhang|first2=Shu&nbsp; Zhong|title=Pivot rules for linear programming: A Survey on recent theoretical developments|issue=Degeneracy in optimization problems, number 1 |journal=Annals of Operations Research|volume=46–47|year=1993|pages=203–233 |doi=10.1007/BF02096264|mr=1260019 |citeseerx = 10.1.1.36.7658 | origyear = 1991 |issn=0254-5330|ref=harv}}

* {{cite journal|last=Wang|first=Zhe&nbsp; Min|title=A finite conformal-elimination free algorithm over oriented&nbsp; matroid programming|journal=Chinese Annals of Mathematics (Shuxue Niankan&nbsp; B&nbsp; Ji)|series=Series&nbsp; B|volume=8|year=1987|number=1|pages=120–125|issn=0252-9599|mr=886756|ref=harv|}}<!-- Google scholar reported no free versions -->}}

==External links==