Content deleted Content added
m →Properties: parenth |
→References: Add free preprints or reprints, or comment-hidden that no free version is listed by Google Scholar |
||
Line 26:
* {{cite book|last=Björner|first=Anders|last2=Las Vergnas|first2=Michel|last3=Sturmfels|first3=Bernd|authorlink3=bernd Sturmfels|last4=White|first4=Neil|last5=Ziegler|first5=Günter|authorlink5=Günter M. Ziegler|title=Oriented Matroids|publisher=Cambridge University Press|year=1999|isbn=9780521777506|url=http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511586507|doi=10.1017/CBO9780511586507|MR=1744046|ref=harv}}
* {{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|ref=harv|id=[http://www.cas.mcmaster.ca/~terlaky/files/dut-twi-96-103.ps.gz PDF preprint]}}
* {{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 |url=http://
|number=1—3|pages=369—395|issue=Papers from the 16th International Symposium on Mathematical Programming held in Lausanne, 1997|editors=Thomas M. Liebling and Dominique de Werra|publisher=North-Holland Publishing Co. |___location=Amsterdam|year=1997|doi=10.1016/S0025-5610(97)00062-2|MR=1464775|ref=harv|id=[http://www.cas.mcmaster.ca/~terlaky/files/crisscross.ps Postscript preprint]|}}
* {{cite book
|first=R. T.
Line 43:
|issue=4
|MR=278972
|url=http://www.math.washington.edu/~rtr/papers/rtr-ElemVectors.pdf|ref=harv|id=[http://www.math.washington.edu/~rtr/papers/rtr-ElemVectors.pdf PDF reprint]|
}}
* {{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 A|79–84|doi=10.1007/BF01585729|url=http://dx.doi.org/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|url=http://dx.doi.org/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 B|ref=harv|issn=0095-8956|doi=10.1016/0095-8956(87)90049-9|url=http://dx.doi.org/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 Zhong|title=Pivot rules for linear programming: A Survey on recent theoretical developments|issue=Degeneracy in optimization problems|journal=Annals of Operations Research|volume=46–47|year=1993|number=1|pages=203–233|doi=10.1007/BF02096264|url=http://dx.doi.org/10.1007/BF02096264|MR=1260019|id=[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.7658&rep=rep1&type=pdf PDF file of (1991) preprint]|publisher=Springer Netherlands|issn=0254-5330|ref=harv}}
* {{cite journal|last=Wang|first=Zhe Min|title=A finite conformal-elimination free algorithm over oriented matroid programming|journal=Chinese Annals of Mathematics (Shuxue Niankan B Ji)|series=Series B|volume=8|year1987|number=1|pages=120–125|issn=0252-9599|MR=886756|ref=harv|<!-- Google scholar reported no free versions -->}}
{{Mathematical programming|state=expanded}}
| |||