Finding Minimum-Cost Flows by Double Scaling

Mapping Intimacies ◽

10.21236/ada214498 ◽

1988 ◽

Cited By ~ 6

Author(s):

Ravindra K. Ahuja ◽

Andrew V. Goldberg ◽

James B. Orlin ◽

Robert E. Tarjan

Keyword(s):

Minimum Cost ◽

Minimum Cost Flows

Download Full-text

Thick non-crossing paths and minimum-cost flows in polygonal domains

Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 ◽

10.1145/1247069.1247079 ◽

2007 ◽

Cited By ~ 14

Author(s):

Valentin Polishchuk ◽

Joseph S.B. Mitchell

Keyword(s):

Minimum Cost ◽

Polygonal Domains ◽

Minimum Cost Flows

Download Full-text

Minimum Cost Flows

Algorithms and Combinatorics - Combinatorial Optimization ◽

10.1007/978-3-662-56039-6_9 ◽

2018 ◽

pp. 215-244

Author(s):

Bernhard Korte ◽

Jens Vygen

Keyword(s):

Minimum Cost ◽

Minimum Cost Flows

Download Full-text

Minimum Cost Flows

Algorithms and Combinatorics - Combinatorial Optimization ◽

10.1007/978-3-662-21708-5_9 ◽

2000 ◽

pp. 185-204

Author(s):

Bernhard Korte ◽

Jens Vygen

Keyword(s):

Minimum Cost ◽

Minimum Cost Flows

Download Full-text

Budget-Constrained Minimum Cost Flows: The Continuous Case

Generalized Network Improvement and Packing Problems ◽

10.1007/978-3-658-16812-4_4 ◽

2016 ◽

pp. 39-76

Author(s):

Michael Holzhauser

Keyword(s):

Minimum Cost ◽

Continuous Case ◽

Minimum Cost Flows

Download Full-text

ε-Optimality for bicriteria programs and its application to minimum cost flows

Computing ◽

10.1007/bf02247962 ◽

1990 ◽

Vol 44 (1) ◽

pp. 21-34 ◽

Cited By ~ 28

Author(s):

G. Ruhe ◽

B. Fruhwirth

Keyword(s):

Minimum Cost ◽

Minimum Cost Flows

Download Full-text

A Primal Algorithm for Finding Minimum-Cost Flows in Capacitated Networks With Applications

Bell System Technical Journal ◽

10.1002/j.1538-7305.1982.tb04325.x ◽

1982 ◽

Vol 61 (6) ◽

pp. 949-968 ◽

Cited By ~ 14

Author(s):

C. L. Monma ◽

M. Segal

Keyword(s):

Minimum Cost ◽

Minimum Cost Flows

Download Full-text