The mean-partition problem
From MaRDI portal
Publication:857804
DOI10.1007/S10898-006-9025-0zbMATH Open1131.90049OpenAlexW1990401814MaRDI QIDQ857804FDOQ857804
Authors: Fei-Hwang Chang, Uriel G. Rothblum, 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
Recommendations
Cites Work
- Cores of convex games
- Inequalities: theory of majorization and its applications
- Optimal partitions having disjoint convex and conic hulls
- Sortabilities of partition properties
- Structured Partitioning Problems
- Separable partitions
- A Polynomial Time Algorithm for Shaped Partition Problems
- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Partition polytopes over 1-dimensional points
- Supermodularity in various partition problems
- Supermodularity in mean-partition problems
- Explicit solution of partitioning problems over a 1-dimensional parameter space
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)