Efficient solutions for weight-balanced partitioning problems

DOI10.1016/j.disopt.2016.06.001zbMath1387.90128arXiv1503.06877OpenAlexW2209233626MaRDI QIDQ1751164

Shmuel Onn, Steffen Borgwardt

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.06877

zbMATH Keywords

integer programmingconvex maximizationconstrained clusteringland consolidation

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (1)

Constructing Clustering Transformations

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric clustering for the consolidation of farmland and woodland
• On clustering bodies: geometry and polyhedral approximation
• \(N\)-fold integer programming
• Nonlinear discrete optimization. An algorithmic theory
• Convex integer maximization via Graver bases
• Optimal partitions having disjoint convex and conic hulls
• Convex combinatorial optimization
• \(n\)-fold integer programming in cubic time
• Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland
• Theory and Applications of n-Fold Integer Programming
• On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams
• Constrained Clustering
• A Polynomial Time Algorithm for Shaped Partition Problems

This page was built for publication: Efficient solutions for weight-balanced partitioning problems