Optimal partitions having disjoint convex and conic hulls

DOI10.1007/BF01586042zbMath0751.90068MaRDI QIDQ1190601

Uriel G. Rothblum, Earl R. Barnes, Alan J. Hoffman

Publication date: 26 September 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

optimal partitiondisjoint conic hulls

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Nonlinear programming (90C30)

Related Items

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions, Optimal separable partitioning in the plane, Counting disjoint 2-partitions for points in the plane, A parallel algorithm for bisection width in trees, The mean-partition problem, Localizing combinatorial properties of partitions, On the vertex characterization of single-shape partition polytopes, An LP-based \(k\)-means algorithm for balancing weighted point sets, Constrained clustering via diagrams: a unified theory and its application to electoral district design, Convex integer optimization by constantly many linear counterparts, Optimal Partitioning Which Maximizes the Weighted Sum of Products, Geometric clustering for the consolidation of farmland and woodland, A polytope approach to the optimal assembly problem, On the number of separable partitions, Efficient solutions for weight-balanced partitioning problems, Biclustering in data mining, Sphere-separable partitions of multi-parameter elements, Strongly 2-shape-sortability of vector partitions, Are there more almost separable partitions than separable partitions?, Stable Clusterings and the Cones of Outer Normals, Good Clusterings Have Large Volume, Convex integer maximization via Graver bases, Linear-shaped partition problems, Vertex characterization of partition polytopes of bipartitions and of planar point sets, Representations and characterizations of vertices of bounded-shape partition polytopes

Cites Work

• Optimal partitions
• Optimal Set Partitioning
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• A New Heuristic for Partitioning the Nodes of a Graph
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• An Algorithm for Partitioning the Nodes of a Graph
• Lower Bounds for the Partitioning of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item