Heuristics for the constrained incremental graph drawing problem

DOI10.1016/J.EJOR.2018.10.017MaRDI QIDQ1634310zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Incremental bipartite drawing problem
• Variable neighborhood descent for the incremental graph drawing
• Tabu search for the dynamic bipartite drawing problem
• scientific article; zbMATH DE number 2084280
• scientific article; zbMATH DE number 2196291

Cites work

• scientific article; zbMATH DE number 1693557 (Why is no real title available?)
• scientific article; zbMATH DE number 2084318 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A User Study in Similarity Measures for Graph Drawing
• A framework for solving VLSI graph layout problems
• AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
• An annotated bibliography of GRASP – Part I: Algorithms
• Benchmarking optimization software with performance profiles.
• Crossing Number is NP-Complete
• Drawing graphs. Methods and models
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Greedy randomized adaptive search procedures
• Incremental bipartite drawing problem
• Optimization by simulated annealing
• TTT plots: a perl program to create time-to-target plots
• 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

Cited in

(9)

• A fast path relinking algorithm for the min-max edge crossing problem
• Efficient GRASP solution approach for the prisoner transportation problem
• Variable neighborhood scatter search for the incremental graph drawing problem
• Tabu search for min-max edge crossing in graphs
• Incremental bipartite drawing problem
• Block-insertion-based algorithms for the linear ordering problem
• Variable neighborhood descent for the incremental graph drawing
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• Tabu search tutorial. A graph drawing application

Describes a project that uses

Uses Software

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

This page was built for publication: Heuristics for the constrained incremental graph drawing problem

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