Optimal Sankey Diagrams via Integer Programming

David Cheng Zarate, Pierre Le Bodic, Tim Dwyer, Graeme Gange, Peter Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

17 Citations (Scopus)


We present the first practical Integer Linear Programming model for Sankey Diagram layout. We show that this approach is viable in terms of running time for reasonably complex diagrams and also that the quality of the layout is measurably and visibly better than heuristic approaches in terms of crossing reduction. Finally, we demonstrate that the model is easily extensible through the addition of constraints, such as arbitrary grouping of nodes.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE Pacific Visualization Symposium, PacificVis 2018
Subtitle of host publication10–13 April 2018 Kobe, Japan
EditorsStefan Bruckner, Koji Koyamada, Bongshin Lee
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages5
ISBN (Electronic)9781538614242
Publication statusPublished - 2018
EventIEEE Pacific Visualization Symposium 2018 - Kobe, Japan
Duration: 10 Apr 201813 Apr 2018
Conference number: 11th
https://ieeexplore.ieee.org/xpl/conhome/8365785/proceeding (Proceedings)


ConferenceIEEE Pacific Visualization Symposium 2018
Abbreviated titlePacificVis 2018
Internet address


  • graph drawings
  • integer programming
  • Visualization

Cite this