Criss-cross algorithm: Difference between revisions

Revision as of 14:36, 20 April 2016

Revision as of 22:07, 1 November 2016

Line 90:

* {{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 |idciteseerx = {{citeseerx|10.1.1.36.7658}} | origyear = 1991 |publisher=Springer Netherlands |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 -->}}