Supermodularity in mean-partition problems

DOI10.1007/S10898-004-7391-ZzbMATH Open1093.90086OpenAlexW2005532955MaRDI QIDQ811892FDOQ811892

Authors: 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

Recommendations

• Permutation polytopes corresponding to strongly supermodular functions
• Equivalence of permutation polytopes corresponding to strictly supermodular functions
• Core-based criterion for extreme supermodular functions
• Supermodular programming on lattices
• Supermodular functions and the complexity of MAX CSP

zbMATH Keywords

supermodularmean-partition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Permutation polytopes corresponding to strongly supermodular functions
• The mean-partition problem
• Title not available (Why is that?)
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
• Decompositions of supermodular functions and \(\square\)-decomposable measures
• Equivalence of permutation polytopes corresponding to strictly supermodular functions
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region

This page was built for publication: Supermodularity in mean-partition problems

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