A strongly polynomial time algorithm for a constrained submodular optimization problem
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.
base polyhedron submodular function max flow min cost spanning tree