A strongly polynomial minimum cost circulation algorithm-Reference-Cited by-同舟云学术

A strongly polynomial minimum cost circulation algorithm

Published:1985-09 Issue:3 Volume:5 Page:247-255
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Tardos Éva

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference14 articles.

1. R. P. Anstee, A polynomial algorithm forb-matching: an alternative approach,Research Report CORR 83–22, University Waterloo, Waterloo, Ontario, 1983.

2. W. H. Cunningham andA. Frank, A primal dual algorithm for submodular flows;Mathematics of Operations Research,10 (1985), 251–262.

3. E. A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power estimation;Soviet Math. Dokl.,11 (1970), 1277–1280.

4. J. Edmonds, Systems of distinct representatives and linear algebra;J. Res. Nat. Bur. Standards,71 B (1967), 241–245.

5. J. Edmonds, Submodular functions, matroids and certain polyhedra, in:Combinatorial Structures and Applications, (R. K. Guy et al. eds.) 1970 Gordon and Breach, New York 67–87.

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

1. Flow Allocation Games;Mathematics of Operations Research;2024-01-22

2. Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport;EURO Journal on Transportation and Logistics;2024

3. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment;ACM Journal of Experimental Algorithmics;2023-08-11

5. Incentive mechanism and path planning for Unmanned Aerial Vehicle (UAV) hitching over traffic networks;Future Generation Computer Systems;2023-08