Title of article
A strongly polynomial time algorithm for a constrained submodular optimization problem Original Research Article
Author/Authors
David Hartvigsen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
12
From page
183
To page
194
Abstract
Hartvigsen (Math. Oper. Res. 23 (1998) 661) presented a weakly polynomial time algorithm for the problem of optimizing over the intersection of a submodular base polyhedron and an affine space (when the number of constraints describing the affine space is bounded). This paper contains a strongly polynomial time algorithm for this problem.
Keywords
Submodular function , Base polyhedron , Min cost spanning tree , Max flow
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885269
Link To Document