A fast path relinking algorithm for the min-max edge crossing problem (Q6568398)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast path relinking algorithm for the min-max edge crossing problem |
scientific article; zbMATH DE number 7877698
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast path relinking algorithm for the min-max edge crossing problem |
scientific article; zbMATH DE number 7877698 |
Statements
A fast path relinking algorithm for the min-max edge crossing problem (English)
0 references
8 July 2024
0 references
metaheuristics
0 references
min-max edge crossing
0 references
graph drawing
0 references
dynamic programming
0 references
path relinking
0 references
0 references
0 references
