Approximate binary search algorithms for mean cuts and cycles

Authors:
S.Thomas Mccormick
Affiliations:
Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, V6T 1Z2 Canada
Venue:
Operations Research Letters
Year:
1993

Citing 6
Cited 0

Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Network flows

Optimization
Minimizing capacity violations in a transshipment network

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
New scaling algorithms for the assignment and minimum mean cycle problems

Mathematical Programming: Series A and B
Two strongly polynomial cut cancelling algorithms for minimum cost network flow

Discrete Applied Mathematics
Newton's method for fractional combinatorial optimization

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iwano, Misono, Tezuka, and Fujishige (1990) have given an approximate binary search algorithm for computing max mean cuts. This paper gives a short proof of the correctness of their algorithm. It also shows how their algorithm can be dualized to an approximate binary search algorithm for computing min mean cycles that is as fast as but simpler than Orlin and Ahuja's algorithm (1992).