| Article ID: | iaor19921471 |
| Country: | Netherlands |
| Volume: | 10 |
| Issue: | 8 |
| Start Page Number: | 489 |
| End Page Number: | 495 |
| Publication Date: | Nov 1991 |
| Journal: | Operations Research Letters |
| Authors: | Chung Nam-kee, Tcha Dong-wan |
| Keywords: | programming: linear |
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.