Talk:Network simplex algorithm
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Low This article has been rated as Low-priority on the project's priority scale. | |||||||||||||||
Another source
I'm not adding this to the article itself because of my conflict of interest, but it's relevant:
- Eppstein, David (2000), "Clustering for faster network simplex pivots", Networks, 35 (3): 173–180, doi:10.1002/(SICI)1097-0037(200005)35:3<173::AID-NET1>3.0.CO;2-W, MR 1764876 .
It improves the time bounds e.g. of the strongly polynomial dual network simplex reference I just added to the article. —David Eppstein (talk) 03:22, 26 May 2015 (UTC) [reply ]