Minimal Total Area Convex Set Partitioning Problem
Minimal Total Area Convex Set Partitioning Problem
Author(s): Štefan PeskoSubject(s): Methodology and research technology
Published by: Žilinská univerzita v Žilině
Keywords: Convexity constraints; set partitioning problem; location problem; convex hull;
Summary/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.
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 11/2009
- Issue No: 3
- Page Range: 39-42
- Page Count: 4
- Language: English