Optimal partitions having disjoint convex and conic hulls

DOI10.1007/BF01586042zbMATH Open0751.90068MaRDI QIDQ1190601FDOQ1190601

Authors: 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)

Recommendations

• The vector partition problem for convex objective functions.
• Vertex characterization of partition polytopes of bipartitions and of planar point sets
• An adaptive algorithm for vector partitioning
• Partitions. Optimality and clustering. Vol. II: Multi-parameter.
• Partition-Optimization with Schur Convex Sum Objective Functions

zbMATH Keywords

optimal partitiondisjoint conic hulls

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A New Heuristic for Partitioning the Nodes of a Graph
• Title not available (Why is that?)
• An Algorithm for Partitioning the Nodes of a Graph
• Lower Bounds for the Partitioning of Graphs
• Optimal partitions
• Optimal Set Partitioning
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (38)

• Vertex characterization of partition polytopes of bipartitions and of planar point sets
• Perfect partitions of convex sets in the plane
• Optimal separable partitioning in the plane
• A note on the value in the disjoint convex partition problem
• Circuits in extended formulations
• On the vertex characterization of single-shape partition polytopes
• A parallel algorithm for bisection width in trees
• Sphere-separable partitions of multi-parameter elements
• The mean-partition problem
• The vector partition problem for convex objective functions.
• Are there more almost separable partitions than separable partitions?
• Efficient solutions for weight-balanced partitioning problems
• Title not available (Why is that?)
• The structure of optimal partitions of orthogonal polygons into fat rectangles
• On the honeycomb conjecture for a class of minimal convex partitions
• A Convex Approach to Minimal Partitions
• Strongly 2-shape-sortability of vector partitions
• Localizing combinatorial properties of partitions
• Representations and characterizations of vertices of bounded-shape partition polytopes
• One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
• Biclustering in data mining
• Geometric clustering for the consolidation of farmland and woodland
• Counting disjoint 2-partitions for points in the plane
• Title not available (Why is that?)
• A polytope approach to the optimal assembly problem
• Good clusterings have large volume
• Convex integer optimization by constantly many linear counterparts
• On the number of separable partitions
• Conical partition algorithm for maximizing the sum of dc ratios
• Partitions by congruent sets and optimal positions
• 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 maximization via Graver bases
• A fixed parameter algorithm for optimal convex partitions
• Linear-shaped partition problems
• Optimal Partitioning Which Maximizes the Weighted Sum of Products
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• Stable Clusterings and the Cones of Outer Normals

This page was built for publication: Optimal partitions having disjoint convex and conic hulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190601)