Content deleted Content added
m →History: add Terlaky |
m Open access bot: doi added to citation with #oabot. |
||
Line 86:
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 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 -->}}
| |||