Heuristics for the constrained incremental graph drawing problem

DOI10.1016/j.ejor.2018.10.017zbMath1404.90141OpenAlexW2897481653MaRDI QIDQ1634310

Rafael Martí, Tommaso Pastore, Paola Festa, Anna Martínez-Gavara, Antonio Napoletano

Publication date: 18 December 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.017

zbMATH Keywords

heuristicscombinatorial optimizationmetaheuristicsgraph drawing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ Tabu search tutorial. A graph drawing application ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Tabu search for min-max edge crossing in graphs

Uses Software

• GRASP
• PERL
• Graphviz
• CPLEX
• LocalSolver
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A framework for solving VLSI graph layout problems
• Tabu search and GRASP for the capacitated clustering problem
• Tabu search for the dynamic bipartite drawing problem
• Variable neighborhood scatter search for the incremental graph drawing problem
• Greedy randomized adaptive search procedures
• TTT plots: a perl program to create time-to-target plots
• Crossing Number is NP-Complete
• An annotated bibliography of GRASP – Part I: Algorithms
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A User Study in Similarity Measures for Graph Drawing
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Drawing graphs. Methods and models
• Incremental bipartite drawing problem
• Benchmarking optimization software with performance profiles.