Out-of-kilter algorithm: Difference between revisions

Content deleted Content added

Revision as of 06:06, 29 January 2021 edit GünniX (talk \| contribs) Extended confirmed users 336,345 edits Undid revision 996554765 by 1overthend (talk) Tag: Undo ← Previous edit		Latest revision as of 15:09, 8 September 2024 edit undo Citation bot (talk \| contribs) Bots 5,861,397 edits Added doi. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:Network flow problem \| #UCB_Category 6/20
(One intermediate revision by one other user not shown)
Line 1: The '''out-of-kilter algorithm''' is an [[algorithm]] that computes the solution to the [[minimum-cost flow problem]] in a [[flow network]]. It was published in 1961 by [[D. R. Fulkerson]]{{nnbsp}}<ref>{{cite journal \|title=An Out-of-Kilter Method for Minimal-Cost Flow Problems \|author=D. R. Fulkerson \|journal=[[Journal of the Society for Industrial and Applied Mathematics]] \|volume=9\|issue=1 \|date=March 1961\|pages=18–27 \|doi=10.1137/0109002 \|jstor=2099013}}</ref> and is described here.<ref name="durbin-and-kroenke-1967">{{cite book \| last1 = Durbin \| first1 = EP \| last2 = Kroenke \| first2 = DM Line 33: ==References== {{reflist\|30em}}<ref>{{Cite web\|url=https://www.maths.cam.ac.uk/sites/www.maths.cam.ac.uk/files/pre2014/undergrad/catam/committee/STATS/8pt4.pdf\|title=Out of Kilter Algorithm\|last=Cambridge\|first=University of\|date=July 2012\|website=www.maths.cam.ac.uk~~\|archive-date=April 22, 2018~~}}</ref> ==External links==