Incremental bipartite drawing problem

DOI10.1016/S0305-0548(00)00040-XzbMath1069.90541WikidataQ126656603 ScholiaQ126656603MaRDI QIDQ5955967

Vicente Estruch, Rafael Martí

Publication date: 23 June 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimizationGraph drawingHeuristic search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Heuristics for the constrained incremental graph drawing problem ⋮ Efficient automated schematic map drawing using multiobjective mixed integer programming ⋮ Tabu search for the dynamic bipartite drawing problem ⋮ ARC crossing minimization in hierarchical digraphs with tabu search ⋮ A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Variable neighborhood descent for the incremental graph drawing ⋮ Variable neighborhood scatter search for the incremental graph drawing problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

Uses Software

• GraphBase

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic heuristic for a computationally difficult set covering problem
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A tabu search algorithm for the bipartite drawing problem
• Greedy randomized adaptive search procedures
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• The NP-completeness column: An ongoing guide

This page was built for publication: Incremental bipartite drawing problem