Drawing graphs with mathematical programming and variable neighborhood search

DOI10.1016/J.ENDM.2017.03.027MaRDI QIDQ1687683zbMATH OpenOpenAlexFDO

Authors Cézar Augusto N. e Silva, Haroldo G. Santos

Publication date 4 January 2018

Full work available at URL https://doi.org/10.1016/j.endm.2017.03.027

zbMATH Keywords

grid graph drawingmixed integer programmingvariable neighborhood search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 2196291
• Variable neighborhood descent for the incremental graph drawing
• Mathematical programs for drawing nonplanar graphs in the plane
• Orthogonal drawings of graphs with vertex and edge labels
• Tabu search for the dynamic bipartite drawing problem

Cites work

• The NP-completeness column: An ongoing guide
• Variable neighborhood search

Cited in

(6)

• Variable neighborhood descent for the incremental graph drawing
• On multi-objective optimization aided drawing of special graphs
• Graph Drawing via Gradient Descent, (GD)^2
• scientific article; zbMATH DE number 2196291 (Why is no real title available?)
• Graphical method of representing variable sets for solving search problems
• Optimal decision trees for the algorithm selection problem: integer programming based approaches

This page was built for publication: Drawing graphs with mathematical programming and variable neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687683)