A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)-Reference-Cited by-同舟云学术

A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(Network Design, Control and Optimization)

Published:2004 Issue:4 Volume:47 Page:244-264
ISSN:0453-4514
Container-title:Journal of the Operations Research Society of Japan
language:en
Short-container-title:JORSJ

Author:

Shigeno Maiko¹

Affiliation:

1. University of Tsukuba

Publisher

The Operations Research Society of Japan

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://www.jstage.jst.go.jp/article/jorsj/47/4/47_KJ00002424949/_pdf

Reference62 articles.

1. 1) AHUJA R. K. Network Flows : Theory, Algorithms and Applications. Prentice Hall. (1993)

2. 2) BERTSEKAS D. Network Optimization : Continuous and Discrete Models. Athena Scientific. (1998)

3. 3) COOK W. J. Combinatorial Optimization. Wiley. (1998)

4. 4) DANTZIG G. B. Linear Programming and Extensions. Princeton University Press. (1962)

5. 5) DINIC E. A. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady. (1970) vol.11, p.1277-1280.

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

1. Generalized maximum flow over time with intermediate storage;Annals of Operations Research;2024-01-04

2. Match4Match: Enhancing Text-Video Retrieval by Maximum Flow with Minimum Cost;Proceedings of the ACM Web Conference 2023;2023-04-30

3. A STRONGLY POLYNOMIAL TIME ALGORITHM FOR AN LP PROBLEM WITH A PRE-LEONTIEF COEFFICIENT MATRIX;Journal of the Operations Research Society of Japan;2022-01-31

4. A Strongly Polynomial Algorithm for Generalized Flow Maximization;Mathematics of Operations Research;2017-01

5. A strongly polynomial algorithm for generalized flow maximization;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31