Revision as of 02:34, 22 March 2011 edit Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →Properties: remove OM see also ← Previous edit		Revision as of 02:51, 22 March 2011 edit undo Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →References: {{Mathematical programming\|state=expanded}} Next edit →
Line 48: * {{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}} {{Mathematical programming\|state=expanded}} {{Optimization algorithms\|state=collapsed}} [[Category:Linear programming]]

Criss-cross algorithm: Difference between revisions