Author of the publication

A Fast and Simple Algorithm for the Maximum Flow Problem.

, and . Operations Research, 37 (5): 748-759 (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Equivalence of the primal and dual simplex algorithms for the maximum flow problem., and . Oper. Res. Lett., 20 (3): 101-108 (1997)Inverse Optimization., and . Operations Research, 49 (5): 771-783 (2001)The Scaling Network Simplex Algorithm., and . Operations Research, 40 (Supplement-1): S5-S13 (1992)On the power of randomization in network interdiction., , and . Oper. Res. Lett., 44 (1): 114-120 (2016)Solving Inverse Spanning Tree Problems Through Network Flow Techniques., , and . Operations Research, 47 (2): 291-298 (1999)A Faster Algorithm for Finding the Minimum Cut in a Graph., and . SODA, page 165-174. ACM/SIAM, (1992)IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson., and . ITOR, 12 (3): 367-372 (2005)Robust optimization with incremental recourse., and . CoRR, (2013)Faster Algorithms for the Shortest Path Problem, , , and . J. ACM, 37 (2): 213-223 (April 1990)A Fast, Simpler Algorithm for the Matroid Parity Problem.. IPCO, volume 5035 of Lecture Notes in Computer Science, page 240-258. Springer, (2008)