Variable neighborhood scatter search for the incremental graph drawing problem
From MaRDI portal
Publication:1694406
DOI10.1007/s10589-017-9926-5zbMath1386.05122OpenAlexW2741657924MaRDI QIDQ1694406
Abraham Duarte, Jesús Sánchez-Oro, Anna Martínez-Gavara, Rafael Martí, Manuel Laguna
Publication date: 1 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9926-5
Related Items
Heuristics for the constrained incremental graph drawing problem, Scatter search for the minimum leaf spanning tree problem, A variable depth neighborhood search algorithm for the min-max arc crossing problem, General variable neighborhood search for the minimum stretch spanning tree problem, Tabu search tutorial. A graph drawing application, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
Uses Software
Cites Work
- Variable neighbourhood search: Methods and applications
- ARC crossing minimization in hierarchical digraphs with tabu search
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Crossing Number is NP-Complete
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Drawing graphs. Methods and models
- Incremental bipartite drawing problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item