Pages that link to "Item:Q1694406"
From MaRDI portal
The following pages link to Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406):
Displaying 7 items.
- Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Tabu search tutorial. A graph drawing application (Q1979170) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)