Revision as of 09:05, 5 April 2011 edit Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →External links: Greenberg, Harvey J., ''Klee-Minty Polytope Shows Exponential Time Complexity of Simplex Method'' University of Colorado at Denver (1997) [http://glossary.computing.society.informs.org/notes/Klee-Minty.pdf PDF download (only two ← Previous edit		Revision as of 08:47, 13 April 2011 edit undo Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →External links: Remove Murty , which doesn't discuss crisscross Next edit →
Line 89: ==External links== * Greenberg, Harvey J., ''Klee-Minty Polytope Shows Exponential Time Complexity of Simplex Method'' University of Colorado at Denver (1997) [http://glossary.computing.society.informs.org/notes/Klee-Minty.pdf PDF download (only two pages!)] * {{cite book\|last=Murty\|first=K. G.\|title=Linear complementarity, linear and nonlinear programming\|series=Sigma Series in Applied Mathematics\|volume=3\|publisher=Heldermann Verlag\|___location=Berlin\|year=1988\|pages=xlviii+629 pp.\|isbn=3-88538-403-5\|url=http://ioe.engin.umich.edu/people/fac/books/murty/linear_complementarity_webbook/\| MR=949214\|id=[http://www-personal.umich.edu/~murty/ Updated and free PDF version at Katta G. Murty's website]\|ref=harv\|}} {{Mathematical programming\|state=expanded}} {{Optimization algorithms\|state=collapsed}}

Criss-cross algorithm: Difference between revisions