A note on submodular function minimization by Chubanov's LP algorithm

被引:2
|
作者
Fujishige, Satoru [1 ]
机构
[1] Kyoto Univ, Res Inst Math Sci, Kyoto 6068502, Japan
关键词
Submodular function minimization; Base polyhedra; Chubanov's algorithm;
D O I
10.1016/j.disopt.2019.04.001
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Recently Dadush et al. (2017) have devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear programming feasibility algorithm of Chubanov (2017) to stimulate further research on SFM. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:140 / 145
页数:6
相关论文
共 50 条