A tabu thresholding algorithm for arc crossing minimization in bipartite graphs

DOI10.1007/BF02125456MaRDI QIDQ1919842zbMATH OpenFDO

Authors Vicente Valls, Rafael Martí, Pilar Lino

Publication date 28 July 1996

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

zbMATH Keywords

heuristicbipartite graphtabu thresholdingacyclic directed graphsarc crossing minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• ARC crossing minimization in hierarchical digraphs with tabu search
• Tabu search for min-max edge crossing in graphs
• Crossing Minimization in Weighted Bipartite Graphs
• Crossing minimization in weighted bipartite graphs
• scientific article; zbMATH DE number 4068924
• A tabu search algorithm for the bipartite drawing problem
• An alternative method to crossing minimization on hierarchical graphs
• scientific article; zbMATH DE number 5309856

Cites work

• scientific article; zbMATH DE number 3963860 (Why is no real title available?)
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• Bandwidth Packing: A Tabu Search Approach
• Crossing Theory and Hierarchy Mapping
• Future paths for integer programming and links to artificial intelligence
• Local Search Algorithms for the Maximal Planar Layout Problem
• Tabu search techniques. A tutorial and an application to neural networks
• The NP-completeness column: An ongoing guide
• The tabu search metaheuristic: How we used it

Cited in

(9)

• 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
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
• Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Metaheuristics: A bibliography
• A tabu search algorithm for the bipartite drawing problem
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization

Describes a project that uses

Uses Software

• Tabu search

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

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