A Submodular Optimization Problem with Side Constraints

DOI10.1287/moor.23.3.661zbMath0977.90073OpenAlexW2028731080MaRDI QIDQ2757558

David B. Hartvigsen

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.3.661

zbMATH Keywords

network flow problemconstrained base polyhedronconstrained submodular optimization problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

A strongly polynomial algorithm for line search in submodular polyhedra ⋮ A strongly polynomial time algorithm for a constrained submodular optimization problem

This page was built for publication: A Submodular Optimization Problem with Side Constraints