guest ::
| Home > Articles > Published articles > A capacity scaling algorithm for convex cost submodular flows |
| Home > Articles > Published articles > A capacity scaling algorithm for convex cost submodular flows |
| Date: | 1997 |
| Abstract: | This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available. . |
| Rights: | Tots els drets reservats.  |
| Language: | Anglès |
| Document: | Article ; recerca ; Versió publicada |
| Subject: | Submodular flow ; Polynomial algorithm ; Convex optimization |
| Published in: | Mathematical Programming, vol. 76 n. 2 (1997) p. 299-308, ISSN 0025-5610 |
 UAB restricted access |
