Arc-based integer programming formulations for three variants of proportional symbol maps

DOI10.1016/j.disopt.2015.09.001zbMath1387.90129OpenAlexW2267132851MaRDI QIDQ1751132

Pedro J. de Rezende, Rafael G. Cano, Tallys Yunes, Cid Carvalho De Souza

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.001

zbMATH Keywords

cartographyvisualizationinteger linear programmingcomputational geometrysymbol maps

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Solving the minimum convex partition of point sets with integer programming ⋮ The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms

Cites Work

• A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps
• On the dimension of projected polyhedra
• On the partial order polytope of a digraph
• Algorithmic aspects of proportional symbol maps
• Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
• On the acyclic subgraph polytope
• The Visible Perimeter of an Arrangement of Disks

This page was built for publication: Arc-based integer programming formulations for three variants of proportional symbol maps