Localizing combinatorial properties of partitions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- A Generalized Binomial Group Testing Problem
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
- Bounds on Multiprocessing Timing Anomalies
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
- Enumerating nested and consecutive partitions
- On Grouping for Maximum Homogeneity
- On clustering problems with connected optima in Euclidean spaces
- Optimal Set Partitioning
- Optimal partitions
- Optimal partitions having disjoint convex and conic hulls
- Optimal partitions of finite populations for Dorfman-type group testing
- Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules
- Structured Partitioning Problems
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
- The Effect of a Capacity Constraint on the Minimal Cost of a Partition
Cited in
(6)- A new approach to solve open-partition problems
- Cluster analysis and mathematical programming
- Strongly 2-shape-sortability of vector partitions
- Locally restricted compositions. IV. Nearly free large parts and gap-freeness
- Local distribution of the parts of unequal partitions in arithmetic progressions. I
- Optimal Partitioning Which Maximizes the Weighted Sum of Products
This page was built for publication: Localizing combinatorial properties of partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126278)
