Revision as of 08:56, 13 April 2011 edit Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →External links: ETH Zentrum, Zurich ← Previous edit		Revision as of 09:01, 13 April 2011 edit undo Kiefer.Wolfowitz (talk \| contribs) 39,688 edits m →References: ce Next edit →
Line 74: \|doi=10.1007/BF02293050\|issue=ACM Symposium on Computational Geometry (North Conway, NH, 1991)\|MR=1174359\|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\|year=1994\|month=March\|pages=365–370\|volume=64\|number=1\|url=http://dx.doi.org/10.1007/BF01582581\|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 \|url=http://dx.doi.org/10.1007/BF02614325\|journal=Mathematical Programming: Series B\|volume=79\|number=1–3\|pages=369–395\|issue=Papers from the 16th International Symposium on Mathematical Programming held in Lausanne, 1997\|editor1-first=Thomas M.\|editor1-last=Liebling\|editor2-first=Dominique\|editor2-last=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]\|}} \|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]\|}} * {{<!-- 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\|ref=harv\|<!-- Zbl=0953.90055 -->\|id={{Zbl\|0953.90055}}. [http://www.cas.mcmaster.ca/~terlaky/files/dut-twi-96-103.ps.gz PDF preprint]\|}}▼ ~~\|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\|<!-- Zbl=0953.90055 -->\|id={{Zbl\|0953.90055}}. [http://www.cas.mcmaster.ca/~terlaky/files/dut-twi-96-103.ps.gz PDF preprint]\|}} * {{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 -->}}

Criss-cross algorithm: Difference between revisions