A fast path relinking algorithm for the min-max edge crossing problem

DOI10.1016/J.COR.2024.106603MaRDI QIDQ6568398zbMATH OpenFDO

Authors Bo Peng, Lunwen Wu, Rafael Martí, Jiangshui Ma

Publication date 8 July 2024

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

Full work available at URL https://doi.org/10.1016/J.COR.2024.106603

zbMATH Keywords

dynamic programminggraph drawingmetaheuristicsmin-max edge crossingpath relinking

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A framework for solving VLSI graph layout problems
• A heuristic for bottleneck crossing minimization and its performance on general crossing minimization, hypothesis and experimental study
• A tabu search algorithm for the bipartite drawing problem
• A variable depth neighborhood search algorithm for the min-max arc crossing problem
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
• Crossing minimization and layouts of directed hypergraphs with port constraints
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Heuristics for the constrained incremental graph drawing problem
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• Parameterized analysis and crossing minimization problems
• Tabu search for min-max edge crossing in graphs
• Tabu search tutorial. A graph drawing application

This page was built for publication: A fast path relinking algorithm for the min-max edge crossing problem

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