Implementing Goldberg's max-flow-algorithm ? A computational investigation-Reference-Cited by-同舟云学术

Implementing Goldberg's max-flow-algorithm ? A computational investigation

Published:1989-11 Issue:6 Volume:33 Page:383-403
ISSN:0340-9422
Container-title:ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research
language:en
Short-container-title:ZOR - Methods and Models of Operations Research

Author:

Derigs U.,Meier W.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

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

Reference13 articles.

1. Cheriyan J, Maheswari SN (1987) Analysis of preflow push algorithms for maximum network flow. Department of Computer Science and Engeneering, Indian Institute of Technology, New Dehli, India

2. Cheung T (1980) Computational comparison of eight methods for the maximum network flow problem. ACM Transactions on Mathematical Software 6/1:1?16

3. Dinic EA (1970) Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady 11/5:1277?1280

4. Ford LR JR, Fulkerson DR (1956) Maximal flow through a network. Canadian Journal of Mathematics 8/3:399?404

5. Glover F, Klingman D, Mote J, Whitman D (1979) Comprehensive computer evaluation for the maximum flow problem. Management Science Report 79-1, University of Colorado, Boulder

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

1. Enhanced instance space analysis for the maximum flow problem;European Journal of Operational Research;2023-01

2. Towards a 15-minute city: A network-based evaluation framework;Environment and Planning B: Urban Analytics and City Science;2022-08-13

3. Index;Network Flow Algorithms;2019-09-05

4. Author Index;Network Flow Algorithms;2019-09-05

5. Open Questions;Network Flow Algorithms;2019-09-05