Content deleted Content added
→Oriented matroids: <ref>{{harvtxt|Roos|1990}}</ref> |
→References: {{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 p |
||
Line 45:
* {{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}}
* {{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}}
* {{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|}}
* {{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}}
| |||