A tabu thresholding algorithm for arc crossing minimization in bipartite graphs

DOI10.1007/BF02125456zbMath0851.90132MaRDI QIDQ1919842

Pilar Lino, Vicente Valls, Rafael Martí

Publication date: 28 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

bipartite graphheuristictabu thresholdingacyclic directed graphsarc crossing minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Metaheuristics: A bibliography ⋮ A rearrangement of adjacency matrix based approach for solving the crossing minimization problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ A tabu search algorithm for the bipartite drawing problem ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Tabu search techniques. A tutorial and an application to neural networks
• The tabu search metaheuristic: How we used it
• Future paths for integer programming and links to artificial intelligence
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• Crossing Theory and Hierarchy Mapping
• Bandwidth Packing: A Tabu Search Approach
• Local Search Algorithms for the Maximal Planar Layout Problem
• The NP-completeness column: An ongoing guide

This page was built for publication: A tabu thresholding algorithm for arc crossing minimization in bipartite graphs