Optimal partitions having disjoint convex and conic hulls
From MaRDI portal
(Redirected from Publication:1190601)
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
Cites work
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- scientific article; zbMATH DE number 3924818 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1983335 (Why is no real title available?)
- A New Heuristic for Partitioning the Nodes of a Graph
- An Algorithm for Partitioning the Nodes of a Graph
- Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
- Lower Bounds for the Partitioning of Graphs
- Optimal Set Partitioning
- Optimal partitions
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
Cited in
(38)- Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
- Stable Clusterings and the Cones of Outer Normals
- 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
- On the vertex characterization of single-shape partition polytopes
- Circuits in extended formulations
- 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
- scientific article; zbMATH DE number 2115904 (Why is no real title available?)
- 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
- Localizing combinatorial properties of partitions
- Strongly 2-shape-sortability of vector 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
- scientific article; zbMATH DE number 6475983 (Why is no real title available?)
- A polytope approach to the optimal assembly problem
- Convex integer optimization by constantly many linear counterparts
- Good clusterings have large volume
- 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
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)
