A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343)
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 6406086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A MIP-based approach to solve the prize-collecting local access network design problem |
scientific article; zbMATH DE number 6406086 |
Statements
A MIP-based approach to solve the prize-collecting local access network design problem (English)
0 references
19 February 2015
0 references
network loading
0 references
local access
0 references
prize-collecting
0 references
matheuristic algorithm
0 references
0.92907774
0 references
0.87599856
0 references
0 references
0.8637775
0 references
0.8636448
0 references
0.83815014
0 references
0.83782434
0 references
0.8378216
0 references
0.8314089
0 references
