Polynomial methods for separable convex optimization in unimodular spaces

Authors:
Alexander V. Karzanov;S. Thomas McCormick
Affiliations:
Institute for System Analysis, 9 Prospect 60 Let Oktyabrya, 117312 Moscow Russia;Faculty of Commerce, University of British Columbia, Vancouver, BC V6T 1Z2 Canada
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Citing 7
Cited 0

Scaling algorithms for network problems

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

Theory of linear and integer programming
Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)
Convex separable optimization is not much harder than linear optimization

Journal of the ACM (JACM)
Tight bounds on the number of minimum-mean cycle cancellations and related results

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Two strongly polynomial cut cancelling algorithms for minimum cost network flow

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract