The accessibility arc upgrading problem (Q2253452)
From MaRDI portal
!
WARNING
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 6321895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The accessibility arc upgrading problem |
scientific article; zbMATH DE number 6321895 |
Statements
The accessibility arc upgrading problem (English)
0 references
27 July 2014
0 references
network upgrading problem
0 references
knapsack problem
0 references
variable neighbourhood search
0 references
0.7531267404556274
0 references
0.7319889068603516
0 references
0.716797947883606
0 references
0.7142655849456787
0 references
0.7042070627212524
0 references
