A capacity scaling algorithm for convex cost submodular flows

被引：24
|
作者：
Iwata, S
机构：
[1] Res. Inst. for Mathematical Sciences, Kyoto University
来源：
MATHEMATICAL PROGRAMMING | 1997年 / 76卷 / 02期
关键词：
submodular flow; polynomial algorithm; convex optimization;
D O I：
10.1007/BF02614442
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：299 / 308
页数：10
相关论文
共 50 条
  • [1] A capacity scaling algorithm for convex cost submodular flows
    Satoru Iwata
    Mathematical Programming, 1997, 76 : 299 - 308
  • [2] A capacity scaling algorithm for convex cost submodular flows
    Iwata, S
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 482 - 489
  • [3] A capacity scaling algorithm for M-convex submodular flow
    Satoru Iwata
    Satoko Moriguchi
    Kazuo Murota
    Mathematical Programming, 2005, 103
  • [4] A capacity scaling algorithm for M-convex submodular flow
    Iwata, S
    Moriguchi, S
    Murota, K
    MATHEMATICAL PROGRAMMING, 2005, 103 (01) : 181 - 202
  • [5] A capacity scaling algorithm for M-convex submodular flow
    Iwata, S
    Moriguchi, S
    Murota, K
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3064 : 352 - 367
  • [6] A faster capacity scaling algorithm for minimum cost submodular flow
    Fleischer, L
    Iwata, S
    McCormick, ST
    MATHEMATICAL PROGRAMMING, 2002, 92 (01) : 119 - 139
  • [7] A faster capacity scaling algorithm for minimum cost submodular flow
    Lisa Fleischer
    Satoru Iwata
    S. Thomas McCormick
    Mathematical Programming, 2002, 92 : 119 - 139
  • [8] A cost-scaling algorithm for 0-1 submodular flows
    Shigeno, M
    Iwata, S
    DISCRETE APPLIED MATHEMATICS, 1997, 73 (03) : 261 - 273
  • [9] Capacity scaling algorithm for scalable M-convex submodular flow problems
    Moriguchi, S
    Murota, K
    OPTIMIZATION METHODS & SOFTWARE, 2003, 18 (02): : 207 - 218
  • [10] A fast cost scaling algorithm for submodular flow
    Iwata, S
    McCormick, ST
    Shigeno, M
    INFORMATION PROCESSING LETTERS, 2000, 74 (3-4) : 123 - 128
12345