Finding minimum-cost flows by double scaling

@article{Ahuja1992FindingMF,
  title={Finding minimum-cost flows by double scaling},
  author={R. Ahuja and A. Goldberg and J. Orlin and R. Tarjan},
  journal={Mathematical Programming},
  year={1992},
  volume={53},
  pages={243-266}
}
  • R. Ahuja, A. Goldberg, +1 author R. Tarjan
  • Published 1992
  • Mathematics, Computer Science
  • Mathematical Programming
  • Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm(log logU) log(nC)) time on networks withn vertices,m edges, maximum arc capacityU, and maximum arc cost magnitudeC. The major techniques used are the capacity-scaling approach of Edmonds and Karp, the excess-scaling approach of Ahuja and Orlin, the cost-scaling approach of Goldberg and… CONTINUE READING
    130 Citations
    Finding Minimum-Cost Circulations by Successive Approximation
    • 289
    Minimum-Cost Flows in Unit-Capacity Networks
    • 9
    A Faster Strongly Polynomial Minimum Cost Flow Algorithm
    • J. Orlin
    • Mathematics, Computer Science
    • Oper. Res.
    • 1993
    • 386
    • PDF
    A new scaling algorithm for the minimum cost network flow problem
    • 9
    On dual minimum cost flow algorithms
    • J. Vygen
    • Mathematics, Computer Science
    • Math. Methods Oper. Res.
    • 2002
    • 38
    algorithm for minimum cost flows
    • 6
    A double scaling algorithm for the constrained maximum flow problem
    • C. Çaliskan
    • Mathematics, Computer Science
    • Comput. Oper. Res.
    • 2008
    • 13
    A polynomial time primal network simplex algorithm for minimum cost flows
    • J. Orlin
    • Mathematics, Computer Science
    • SODA '96
    • 1996
    • 198
    • PDF
    AD-A 254 048 Fast Approximation Algorithms for Multicommodity Flow Problems
    • PDF
    Approximating the single source unsplittable min-cost flow problem
    • M. Skutella
    • Mathematics, Computer Science
    • Proceedings 41st Annual Symposium on Foundations of Computer Science
    • 2000
    • 3
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Finding Minimum-Cost Circulations by Successive Approximation
    • 289
    Improved Time Bounds for the Maximum Flow Problem
    • 130
    • PDF
    A faster strongly polynomial minimum cost flow algorithm
    • J. Orlin
    • Mathematics, Computer Science
    • STOC '88
    • 1988
    • 275
    • PDF
    Faster Scaling Algorithms for Network Problems
    • 414
    • PDF
    Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
    • 2,279
    • Highly Influential
    • PDF
    Scaling algorithms for network problems
    • H. Gabow
    • Mathematics, Computer Science
    • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
    • 1983
    • 96
    • PDF
    A Fast and Simple Algorithm for the Maximum Flow Problem
    • 131
    • PDF
    Efficient graph algorithms for sequential and parallel computers
    • 152
    • Highly Influential
    A bad network problem for the simplex method and other minimum cost flow algorithms
    • 141
    • Highly Influential
    A Data Structure for Dynamic Trees
    • 384
    • PDF