Optimal partitions
From MaRDI portal
Publication:1135855
DOI10.1007/BF00933355zbMath0426.05008OpenAlexW4240458717MaRDI QIDQ1135855
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933355
algorithmscomputational complexitycostoptimal partitionsordered partitionsoptimal partition problemmajorizationsoptimal ordered partition problem
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Dynamic programming (90C39) Elementary theory of partitions (11P81)
Related Items (16)
On a problem of Doob about angular and fine cluster values ⋮ Partitioning of sequentially ordered systems using linear programming ⋮ Localizing combinatorial properties of partitions ⋮ Three-partitioning containing kernels: Complexity and heuristic ⋮ Optimal Set Partitioning ⋮ Seasonal clustering technique for time series data ⋮ A new approach to solve open-partition problems ⋮ Optimal Partitioning Which Maximizes the Weighted Sum of Products ⋮ Constrained partitioning problems ⋮ Optimal partitions having disjoint convex and conic hulls ⋮ Operations research and data mining ⋮ Constrained partitioning problems ⋮ Sterrett procedure for the generalized group testing problem ⋮ Min-Max partitioning problem with matroid constraint ⋮ Enumerating nested and consecutive partitions ⋮ Parametric linear programming and cluster analysis
Cites Work
- Unnamed Item
- On Grouping for Maximum Homogeneity
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- The Effect of a Capacity Constraint on the Minimal Cost of a Partition
- A Generalized Binomial Group Testing Problem
- On the Computational Complexity of Combinatorial Problems
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
This page was built for publication: Optimal partitions