Tabu search for the dynamic bipartite drawing problem
From MaRDI portal
Publication:1652530
DOI10.1016/j.cor.2017.10.011zbMath1391.90611OpenAlexW2766088770MaRDI QIDQ1652530
Rafael Martí, Anna Martínez-Gavara, Jesús Sánchez-Oro, Abraham Duarte
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.10.011
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Heuristics for the constrained incremental graph drawing problem ⋮ Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach ⋮ A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Strategic oscillation for the balanced minimum sum-of-squares clustering problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Block-insertion-based algorithms for the linear ordering problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GRASP and path relinking for the max-min diversity problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Crossing Number is NP-Complete
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Clustering, Visualizing, and Navigating for Large Dynamic Graphs
- Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
- Graph Drawing
- Incremental bipartite drawing problem
This page was built for publication: Tabu search for the dynamic bipartite drawing problem
