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 |