On the number of separable partitions

DOI10.1007/s10878-009-9263-4zbMath1319.05020OpenAlexW2043819507MaRDI QIDQ491209

Uriel G. Rothblum, Frank K. Hwang

Publication date: 24 August 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9263-4

zbMATH Keywords

partitionscombinatorial optimizationseparable partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Algorithms for Radon partitions with tolerance ⋮ Are there more almost separable partitions than separable partitions? ⋮ Computing a Nonnegative Matrix Factorization---Provably

Cites Work

• Unnamed Item
• Optimal partitions having disjoint convex and conic hulls
• Separable partitions
• Enumerating nested and consecutive partitions
• Sphere-separable partitions of multi-parameter elements
• The Vector Partition Problem for Convex Objective Functions
• Geometric clusterings
• 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
• Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
• A Polynomial Time Algorithm for Shaped Partition Problems
• Optimal Partitioning Which Maximizes the Sum of the Weighted Averages
• The number of partitions of a set of N points in k dimensions induced by hyperplanes
• Partition of Space