Pages that link to "Item:Q1652530"
From MaRDI portal
The following pages link to Tabu search for the dynamic bipartite drawing problem (Q1652530):
Displaying 13 items.
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Drawing graphs with mathematical programming and variable neighborhood search (Q1687683) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach (Q2668674) (← 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)
- Strategic oscillation for the balanced minimum sum-of-squares clustering problem (Q6149519) (← links)