Tabu search for min-max edge crossing in graphs

DOI10.1016/j.cor.2019.104830zbMath1458.90621OpenAlexW2980847216WikidataQ127014511 ScholiaQ127014511MaRDI QIDQ2337395

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

Publication date: 19 November 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104830

zbMATH Keywords

combinatorial optimizationmetaheuristicsgraph drawing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Tabu search tutorial. A graph drawing application ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• A tabu search algorithm for the bipartite drawing problem
• Heuristics for the constrained incremental graph drawing problem
• On dealing with strategic and tactical decision levels in forestry planning under uncertainty
• A user's guide to tabu search
• An improved simulated annealing algorithm for bandwidth minimization
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
• Tabu Search—Part I
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A heuristic for bottleneck crossing minimization and its performance on general crossing minimization

This page was built for publication: Tabu search for min-max edge crossing in graphs