A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variable depth neighborhood search algorithm for the min-max arc crossing problem |
scientific article |
Statements
A variable depth neighborhood search algorithm for the min-max arc crossing problem (English)
0 references
9 March 2022
0 references
graph drawing
0 references
min-max arc crossing problem
0 references
meta-heuristic
0 references
variable depth search
0 references
incremental evaluation strategy
0 references
0 references
0 references
0 references
