ARC crossing minimization in hierarchical digraphs with tabu search
type: Item
instance of: scholarly article
title: ARC crossing minimization in hierarchical digraphs with tabu search
zbMATH Open document ID: 0883.90119
DOI: 10.1016/S0305-0548(96)00083-4
author: Manuel Laguna
author: Rafael Martí
author: Vicente Valls
published in: Computers \& Operations Research
publication date: 1997-11-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1083961
zbMATH Keywords: graph drawing
zbMATH Keywords: multi-layer hierarchical digraph
zbMATH Keywords: insertion mechanism
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Crossing Theory and Hierarchy Mapping
cites work: Crossing Number is NP-Complete
cites work: Q3731621
cites work: Q4350040
cites work: Incremental bipartite drawing problem
cites work: Experiments on drawing 2-level hierarchical graphs
cites work: DAG—a program that draws directed graphs
cites work: Q3985344
cites work: How to Draw a Graph
cites work: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
cites work: Tabu Search—Part I
cites work: A user's guide to tabu search
cites work: Q4495496
full work available at URL: s0305-0548(96)00083-4
OpenAlex ID: W2030655309
description: scientific article; zbMATH DE number 1083961