Pages that link to "Item:Q1373159"
From MaRDI portal
The following pages link to ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159):
Displaying 6 items.
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
