Polyhedrally tight set functions and discrete convexity

MaRDI QIDQ5453760zbMATH OpenFDO

Authors

Publication date 3 April 2008

zbMATH Keywords

discrete separation theorem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Recommendations

• On set functions that can be extended to convex functionals
• Discrete convexity
• Notes on L-/M-convex functions and the separation theorems
• scientific article; zbMATH DE number 1303529
• Discrete convexity and its applications

Cited in

(5)

• Polytope bounds on multivariate value sets
• On set functions that can be extended to convex functionals
• Discrete convexity
• scientific article; zbMATH DE number 4033496 (Why is no real title available?)
• Discrete strip-concave functions, Gelfand--Tsetlin patterns, and related polyhedra

This page was built for publication: Polyhedrally tight set functions and discrete convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453760)