The mean-partition problem
From MaRDI portal
Recommendations
Cites work
- A Polynomial Time Algorithm for Shaped Partition Problems
- Cores of convex games
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Explicit solution of partitioning problems over a 1-dimensional parameter space
- Inequalities: theory of majorization and its applications
- Optimal partitions having disjoint convex and conic hulls
- Partition polytopes over 1-dimensional points
- Separable partitions
- Sortabilities of partition properties
- Structured Partitioning Problems
- Supermodularity in mean-partition problems
- Supermodularity in various partition problems
Cited in
(3)
This page was built for publication: The mean-partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857804)