Efficient heuristics for the minimum labeling global cut problem (Q1791898)
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: Efficient heuristics for the minimum labeling global cut problem |
scientific article; zbMATH DE number 6951740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient heuristics for the minimum labeling global cut problem |
scientific article; zbMATH DE number 6951740 |
Statements
Efficient heuristics for the minimum labeling global cut problem (English)
0 references
11 October 2018
0 references
edge-labeled graphs
0 references
variable neighborhood search
0 references
connectivity
0 references
0.8175560235977173
0 references
0.7915054559707642
0 references
0.7789441347122192
0 references
0.7645608186721802
0 references
0.7614103555679321
0 references
