Supermodularity in mean-partition problems

DOI10.1007/s10898-004-7391-zzbMath1093.90086OpenAlexW2005532955MaRDI QIDQ811892

N. E. Zubov

Publication date: 23 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-7391-z

zbMATH Keywords

supermodularmean-partition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

The mean-partition problem

Cites Work

• Partition polytopes over 1-dimensional points
• Permutation polytopes corresponding to strongly supermodular functions
• Cores of convex games
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• Supermodularity in various partition problems