A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5818802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation |
scientific article; zbMATH DE number 5818802 |
Statements
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (English)
0 references
24 November 2010
0 references
edge-connectivity
0 references
augmentation
0 references
survivable networks
0 references
local search
0 references
heuristics
0 references
set covering
0 references
very large scale neighborhood
0 references
0 references
0.8091080784797668
0 references
0.8024457693099976
0 references
0.7945529818534851
0 references
