Localizing combinatorial properties of partitions
From MaRDI portal
Publication:1126278
DOI10.1016/0012-365X(95)00146-NzbMath0863.05008MaRDI QIDQ1126278
Uriel G. Rothblum, Yi-Ching Yao, Frank K. Hwang
Publication date: 8 December 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
consistencybalancednessnestednessoptimal partitionssortabilityconsecutivenessfully nested partitionsproperties of partitions
Related Items
Cluster analysis and mathematical programming ⋮ A new approach to solve open-partition problems ⋮ Optimal Partitioning Which Maximizes the Weighted Sum of Products ⋮ Strongly 2-shape-sortability of vector partitions
Cites Work
- Unnamed Item
- Optimal partitions of finite populations for Dorfman-type group testing
- On clustering problems with connected optima in Euclidean spaces
- Optimal partitions
- Optimal partitions having disjoint convex and conic hulls
- Enumerating nested and consecutive partitions
- Optimal Set Partitioning
- On Grouping for Maximum Homogeneity
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
- Structured Partitioning Problems
- The Effect of a Capacity Constraint on the Minimal Cost of a Partition
- A Generalized Binomial Group Testing Problem
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
- Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules
- Bounds on Multiprocessing Timing Anomalies