A polynomial algorithm for abstract maximum flow

Authors:
S. Thomas McCormick
Affiliations:
Faculty of Commerce and Business Administration University of British, Columbia, Vancouver, BC V6T 1Z2 Canada
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Citing 4
Cited 2

Scaling algorithms for network problems

Journal of Computer and System Sciences
Theory of linear and integer programming

Theory of linear and integer programming
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)

A polynomial algorithm for weighted abstract flow

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A primal-dual algorithm for weighted abstract cut packing

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract