Polyhedral results for a class of cardinality constrained submodular minimization problems Published: 2014/08/29 Shabbir AhmedJiajin YuCategories (Mixed) Integer Linear Programming, 0-1 Programming, Cutting Plane Approaches Tags integer programming, polyhedral theory, submodular optimization Motivated by concave cost combinatorial optimization problems, we study the following mixed integer nonlinear set: P = {(w,x) : w >= f(a’x), e’x