Pages that link to "Item:Q5955967"
From MaRDI portal
The following pages link to Incremental bipartite drawing problem (Q5955967):
Displaying 8 items.
- Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
