A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm-Reference-Cited by-同舟云学术

A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Published:1986-07 Issue:3 Volume:35 Page:298-308
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Fujishige Satoru

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580882.pdf

Reference10 articles.

1. W.H. Cunningham and A. Frank, “A primal-dual algorithm for submodular flows“,Mathematics of Operations Research 10 (1985) 251–262.

2. E.A. Dinic, “Algorithm for solution of a problem of maximum flow in a network with power estimation“,Soviet Mathematics Doklady 11 (1970) 1277–1280.

3. J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs“,Annals of Discrete Mathematics 1 (1977) 185–204.

4. J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems“,Journal of the Association for Computing Machinery 19 (1972) 248–264.

5. L.R. Ford, Jr., and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, NJ, 1962).

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An update-and-stabilize framework for the minimum-norm-point problem;Mathematical Programming;2024-04-18

2. A survey on exact algorithms for the maximum flow and minimum‐cost flow problems;Networks;2023-06-20

3. An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem;Integer Programming and Combinatorial Optimization;2023

4. About the minimum mean cycle-canceling algorithm;Discrete Applied Mathematics;2015-12

5. References;Integer and Combinatorial Optimization;2014-08-22