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

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

0.00 Avg rating—0 Votes
Article ID: iaor201530299
Volume: 18
Issue: 11
Start Page Number: 87
End Page Number: 110
Publication Date: Nov 2015
Journal: Discrete Optimization
Authors: , , ,
Keywords: programming: integer, heuristics, graphs
Abstract:

  • A new formulation is described to create optimal proportional symbol maps.
  • We address three problem variants, two of which are known to be NP‐hard.
  • Efficient separation routines and lifting procedures are described.
  • The new formulation is up to 82 times faster than the others in the literature.
  • Most known benchmark instances can now be solved in less than one minute.

    • Reviews

    Required fields are marked *. Your email address will not be published.