Heuristics and meta-heuristics for 2-layer straight line crossing minimization
type: Item
instance of: scholarly article
title: Heuristics and meta-heuristics for 2-layer straight line crossing minimization
zbMATH Open document ID: 1019.68080
DOI: 10.1016/S0166-218X(02)00397-9
author: Rafael Martí
author: Manuel Laguna
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1925267
zbMATH Keywords: GRASP implementation
describes a project that uses: Tabu search
describes a project that uses: GraphBase
MaRDI profile type: Publication
cites work: Q4350061
cites work: Q3731621
cites work: Edge crossings in drawings of bipartite graphs
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: DAG—a program that draws directed graphs
cites work: Q4354785
cites work: The NP-completeness column: An ongoing guide
cites work: Q3140399
cites work: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
cites work: ARC crossing minimization in hierarchical digraphs with tabu search
cites work: Experiments on drawing 2-level hierarchical graphs
cites work: A tabu search algorithm for the bipartite drawing problem
cites work: A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
cites work: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
full work available at URL: s0166-218x(02)00397-9
OpenAlex ID: W2058594920
description: scientific article; zbMATH DE number 1925267