Tabu search tutorial. A graph drawing application
From MaRDI portal
Publication:1979170
DOI10.1007/s11750-021-00605-1zbMath1474.90531OpenAlexW3172966269MaRDI QIDQ1979170
Rafael Martí, Vicente Campos, Fred Glover
Publication date: 2 September 2021
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00605-1
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A tabu search algorithm for the bipartite drawing problem
- Heuristics for the constrained incremental graph drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Probabilistic tabu search for the cross-docking assignment problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Future paths for integer programming and links to artificial intelligence
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Tabu search for min-max edge crossing in graphs
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Tabu Search—Part I
- Tabu Search—Part II
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
- Drawing graphs. Methods and models
