A dual algorithm for submodular flow problems

Authors:
Nam-Kee Chung;Dong-Wan Tcha
Affiliations:
Department of Industrial Engineering, Chonnam National University, Kwangju, South Korea;Department of Management Science, Korea Advanced Institute of Science and Technology, Seoul, South Korea
Venue:
Operations Research Letters
Year:
1991

Citing 3
Cited 1

An out-of-kilter method for submodular flows

Discrete Applied Mathematics - Discrete applied mathematics in Japan
Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Dual algorithms for pure network problems

Operations Research

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dual algorithm for the submodular flow problem is proposed. The concept of the 'best improving set' is used to increase the dual objective as fast as possible, which is the kind of steepest ascent method employed by R. Hassin for the minimum cost flow problem. For the dual optimal solution thus obtained, the associated submodular flow is constructed by complementary slackness.