A polynomial time primal network simplex algorithm for minimum cost flows

By James B. Orlin. 1996

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Andrew Hundt
2. Gregory Hager
3. Varun Jain
4. Edward D. Kim
5. Francisco Santos
6. Filippo Santambrogio
7. G. Peyr'e
8. Pratik Chaudhari

Citations in the corpus

• sharpDARTS: Faster and More Accurate Differentiable Architecture Search (2019, methodology): “Arbitrary multi-path subgraphs respecting this budget could be chosen by iterative search with a graph algorithm like network simplex[17].”
• An Update on the Hirsch Conjecture (2009, background): “Diameters of network-flow polytopes, which include transportation polytopes, have quadratic bounds [13, 28, 51].”
• Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling (2015, background): “For instance, in [245] a polynomial bound on the cost of a network simplex”