A dual algorithm for submodular flow problems (Q1183393)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dual algorithm for submodular flow problems |
scientific article; zbMATH DE number 33258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual algorithm for submodular flow problems |
scientific article; zbMATH DE number 33258 |
Statements
A dual algorithm for submodular flow problems (English)
0 references
28 June 1992
0 references
The authors propose a dual algorithm for the submodular flow problem. 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 \textit{R. Hassin} [Math. Program. 25, 228-239 (1983; Zbl 0501.90035)] for the minimum cost flow problem. For the dual optimal solution thus obtained the associated submodular flow is constructed by complementary slackness.
0 references
dual algorithm
0 references
submodular flow problem
0 references
best improving set
0 references
steepest ascent method
0 references
0 references
