Minimal Total Area Convex Set Partitioning Problem

  • Stefan Pesko
Keywords: Convexity constraints, set partitioning problem, location problem, convex hull

Abstract

The linear binary model for finding set partitioning of the points in the plane is studied.

We present heuristic which generates partitioning of points to clusters for a given number of seeds with searched seeds of clusters in a plane. For this cluster the convex hulls are constructed via Graham’s scan algorithm. This approach is demonstrated on the real instance of Florida area with 235 points for 10 and 13 clusters.

Author Biography

Stefan Pesko

Department of Mathematical Methods, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Published
2009-09-30
How to Cite
Pesko, S. (2009). Minimal Total Area Convex Set Partitioning Problem. Communications - Scientific Letters of the University of Zilina, 11(3), 39-42. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/1005
Issue
Vol 11 No 3 (2009)
Section
Articles