Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow

Authors:
Maiko Shigeno;Satoru Iwata;S. Thomas Mccormick
Affiliations:
-;-;-
Venue:
Mathematics of Operations Research
Year:
2000

Citing 0
Cited 6

A polynomial combinatorial algorithm for generalized minimum cost flow

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Generic Primal Algorithms for Solving General Integer Programs

Mathematics of Operations Research
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Supply chain network design and transshipment hub location for third party logistics providers

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two new scaling algorithms for the minimum cost network flow problem, one a primal cycle canceling algorithm, the other a dual cut canceling algorithm. Both algorithms scale a relaxed optimality parameter, and create a second, inner relaxation. The primal algorithm uses the inner relaxation to cancel a most negative node-disjoint family of cycles w.r.t. the scaled parameter, the dual algorithm uses it to cancel most positive cuts w.r.t. the scaled parameter. We show that in a network withn nodes andm arcs, both algorithms need to cancel onlyO(mn) objects per scaling phase.Furthermore, we show how to efficiently implement both algorithms to yield weakly polynomial running times that are as fast as any other cycle or cut canceling algorithms. Our algorithms have potential practical advantages compared to some other canceling algorithms as well.Along the way, we give a comprehensive survey of cycle and cut canceling algorithms for min-cost flow. We also clarify the formal duality between cycles and cuts.