A tabu search algorithm for the bipartite drawing problem

DOI10.1016/S0377-2217(97)00291-9zbMath0991.90128MaRDI QIDQ1609918

Rafael Martí

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

tabu searcharc crossing minimizationgraph drawing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40)

Related Items (8)

A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Variable neighborhood descent for the incremental graph drawing ⋮ Tabu search tutorial. A graph drawing application ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Incremental bipartite drawing problem ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Tabu search for min-max edge crossing in graphs

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• Edge crossings in drawings of bipartite graphs
• Algorithms for drawing graphs: An annotated bibliography
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Tabu Search—Part I
• Tabu Search—Part II
• Crossing Theory and Hierarchy Mapping
• A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
• Experiments on drawing 2-level hierarchical graphs
• The NP-completeness column: An ongoing guide

This page was built for publication: A tabu search algorithm for the bipartite drawing problem