About strongly polynomial time algorithms for quadratic optimization over submodular constraints
convex separable quadratic minimization over submodular constraints
scientific article; zbMATH DE number 849128