• DOI:10.1007/BF01585705
Corpus ID: 2005821

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

View on Springer

dspace.mit.edu

Save to Library

Create Alert

Cite

Launch Research Feed