The mean-partition problem

DOI10.1007/s10898-006-9025-0zbMath1131.90049OpenAlexW1990401814MaRDI QIDQ857804

Uriel G. Rothblum, Fei-Hwang Chang, Frank K. Hwang

Publication date: 5 January 2007

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

Full work available at URL: https://doi.org/10.1007/s10898-006-9025-0

zbMATH Keywords

MeansCombinatorial OptimizationPartition Problems

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial optimization (90C27)

Cites Work

• Supermodularity in mean-partition problems
• Optimal partitions having disjoint convex and conic hulls
• Separable partitions
• Sortabilities of partition properties
• Partition polytopes over 1-dimensional points
• Cores of convex games
• Structured Partitioning Problems
• Explicit solution of partitioning problems over a 1-dimensional parameter space
• A Polynomial Time Algorithm for Shaped Partition Problems
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• Inequalities: theory of majorization and its applications
• Supermodularity in various partition problems

This page was built for publication: The mean-partition problem