A tabu search algorithm for the bipartite drawing problem

DOI10.1016/S0377-2217(97)00291-9MaRDI QIDQ1609918zbMATH OpenFDO

Authors Rafael Martí

Publication date 18 August 2002

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

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00291-9

zbMATH Keywords

arc crossing minimizationgraph drawing problemtabu search

Mathematics Subject Classification ID

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

Recommendations

• Tabu search for the dynamic bipartite drawing problem
• scientific article; zbMATH DE number 1054930
• Tabu search for graph partitioning
• Incremental bipartite drawing problem
• A tabu search algorithm for the covering design problem
• An algorithm based on tabu search for satisfiability problem
• A tabu search algorithm for a two-dimensional non-guillotine cutting problem
• An effective iterated tabu search for the maximum bisection problem
• A tabu search algorithm for the quadratic assignment problem

Cites work

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Algorithms for drawing graphs: An annotated bibliography
• Crossing Theory and Hierarchy Mapping
• Edge crossings in drawings of bipartite graphs
• Experiments on drawing 2-level hierarchical graphs
• scientific article; zbMATH DE number 3963860 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Tabu Search—Part I
• Tabu Search—Part II
• The NP-completeness column: An ongoing guide

Cited in

(16)

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• Edge crossings in drawings of bipartite graphs
• ARC crossing minimization in hierarchical digraphs with tabu search
• A new lower bound for the bipartite crossing number with applications
• Tabu search for the dynamic bipartite drawing problem
• Variable neighborhood descent for the incremental graph drawing
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Tabu search tutorial. A graph drawing application
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Tabu search for min-max edge crossing in graphs
• A variable depth neighborhood search algorithm for the min-max arc crossing problem
• scientific article; zbMATH DE number 1054930 (Why is no real title available?)
• Incremental bipartite drawing problem
• Comments on: ``Tabu search tutorial. A graph drawing application
• A fast path relinking algorithm for the min-max edge crossing problem

Describes a project that uses

Uses Software

• Tabu search

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

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