Pages that link to "Item:Q1609918"

The following pages link to A tabu search algorithm for the bipartite drawing problem (Q1609918):

Displaying 16 items.

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
• Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
• ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
• A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
• Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
• Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
• Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
• A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
• (Q4350040) (← links)
• Incremental bipartite drawing problem (Q5955967) (← links)
• Comments on: ``Tabu search tutorial. A graph drawing application'' (Q5970665) (← links)
• A fast path relinking algorithm for the min-max edge crossing problem (Q6568398) (← links)