Minimal Total Area Convex Set Partitioning Problem
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2009-09-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-200903-0008_minimal-total-area-convex-set-partitioning-problem.php |
| _version_ | 1797847015247314944 |
|---|---|
| author | Stefan Pesko |
| author_facet | Stefan Pesko |
| author_sort | Stefan Pesko |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-09T18:04:41Z |
| format | Article |
| id | doaj.art-3a182489094348cba0b788bedc80f7ea |
| institution | Directory Open Access Journal |
| issn | 1335-4205 2585-7878 |
| language | English |
| last_indexed | 2024-04-09T18:04:41Z |
| publishDate | 2009-09-01 |
| publisher | University of Žilina |
| record_format | Article |
| series | Communications |
| spelling | doaj.art-3a182489094348cba0b788bedc80f7ea2023-04-14T06:30:09ZengUniversity of ŽilinaCommunications1335-42052585-78782009-09-01113394210.26552/com.C.2009.3.39-42csl-200903-0008Minimal Total Area Convex Set Partitioning ProblemStefan Pesko0Department of Mathematical Methods, Faculty of Management Science and Informatics, University of Zilina, SlovakiaThe 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.https://komunikacie.uniza.sk/artkey/csl-200903-0008_minimal-total-area-convex-set-partitioning-problem.phpconvexity constraintsset partitioning problemlocation problemconvex hull |
| spellingShingle | Stefan Pesko Minimal Total Area Convex Set Partitioning Problem Communications convexity constraints set partitioning problem location problem convex hull |
| title | Minimal Total Area Convex Set Partitioning Problem |
| title_full | Minimal Total Area Convex Set Partitioning Problem |
| title_fullStr | Minimal Total Area Convex Set Partitioning Problem |
| title_full_unstemmed | Minimal Total Area Convex Set Partitioning Problem |
| title_short | Minimal Total Area Convex Set Partitioning Problem |
| title_sort | minimal total area convex set partitioning problem |
| topic | convexity constraints set partitioning problem location problem convex hull |
| url | https://komunikacie.uniza.sk/artkey/csl-200903-0008_minimal-total-area-convex-set-partitioning-problem.php |
| work_keys_str_mv | AT stefanpesko minimaltotalareaconvexsetpartitioningproblem |