Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804)
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: Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization |
scientific article; zbMATH DE number 7136795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization |
scientific article; zbMATH DE number 7136795 |
Statements
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (English)
0 references
26 November 2019
0 references
edge crossing minimization
0 references
combinatorial optimization
0 references
simulated annealing
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7720868587493896
0 references
0.7493471503257751
0 references
0.7355713248252869
0 references
