Variable neighborhood descent for the incremental graph drawing

DOI10.1016/j.endm.2017.03.024zbMath1388.90119OpenAlexW2606775109MaRDI QIDQ1687677

Jesús Sánchez-Oro, Abraham Duarte, Manuel Laguna, Anna Martínez-Gavara, Rafael Martí

Publication date: 4 January 2018

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

zbMATH Keywords

metaheuristicsvariable neighborhood descentincremental graph drawing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Variable neighbourhood search: Methods and applications
• ARC crossing minimization in hierarchical digraphs with tabu search
• A tabu search algorithm for the bipartite drawing problem
• Crossing Number is NP-Complete
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• Incremental bipartite drawing problem