An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems (Q2840753)
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: An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems |
scientific article; zbMATH DE number 6190284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems |
scientific article; zbMATH DE number 6190284 |
Statements
23 July 2013
0 references
VNS
0 references
profile
0 references
vertex separation
0 references
metaheuristic
0 references
An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems (English)
0 references
0.8605465888977051
0 references
0.836656391620636
0 references
0.8361386060714722
0 references
0.8272410035133362
0 references
0.8258945941925049
0 references
