Jump to content

Talk:Criss-cross algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kiefer.Wolfowitz (talk | contribs) at 21:46, 21 March 2011 ({{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://www.cas.mcmaster.ca/~terlaky/files/crisscross.ps|journal=). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This is the most important survey article on the topic.  Kiefer.Wolfowitz  (Discussion) 21:46, 21 March 2011 (UTC)[reply]

Fukuda, Komei; Terlaky, Tamás (1997). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming: Series B. 79 (Papers from the 16th International Symposium on Mathematical Programming held in Lausanne, 1997). Amsterdam: North-Holland Publishing Co.: 369–395. doi:10.1016/S0025-5610(97)00062-2. MR 1464775. {{cite journal}}: Cite has empty unknown parameter: |1= (help); More than one of |number= and |issue= specified (help); Unknown parameter |editors= ignored (|editor= suggested) (help)