A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
JAMES B ORLIN Aviv Eisenschtat 652013 Introduction Developed in 1989 Based on the Edmonds amp Karp scaling algorithm Fastest strongly polynomial algorithm for mincost flow Fairly simple and intuitive
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "A FASTER STRONGLY POLYNOMIAL MINIMUM COS..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.