| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP - Brazil
[2] Univ Miami, Sch Business Adm, Coral Gables, FL 33124 - USA
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | DISCRETE OPTIMIZATION; v. 18, p. 87-110, NOV 2015. |
| Web of Science Citations: | 1 |
| Abstract | |
Proportional symbol maps are a cartographic tool that employs scaled symbols to represent data associated with specific locations. The symbols we consider are opaque disks, which may be partially covered by other overlapping disks. We address the problem of creating a suitable drawing of the disks that maximizes one of two quality metrics: the total and the minimum visible length of disk boundaries. We study three variants of this problem, two of which are known to be NP-hard and another whose complexity is open. We propose novel integer programming formulations for each problem variant and test them on real-world instances with a branch-and-cut algorithm. When compared with state-of-the-art models from the literature, our models significantly reduce computation times for most instances. (C) 2015 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 12/00673-2 - A study of combinatorial optimization problems related to data visualization |
| Grantee: | Rafael Ghussn Cano |
| Support Opportunities: | Scholarships in Brazil - Doctorate (Direct) |
| FAPESP's process: | 07/52015-0 - Approximation methods for visual computing |
| Grantee: | Jorge Stolfi |
| Support Opportunities: | Research Projects - Thematic Grants |