Incremental network design with shortest paths (Q296857)
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 6597563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Incremental network design with shortest paths |
scientific article; zbMATH DE number 6597563 |
Statements
Incremental network design with shortest paths (English)
0 references
23 June 2016
0 references
network design
0 references
multi-period
0 references
heuristic
0 references
approximation algorithm
0 references
integer programming
0 references
0 references
0 references
0.8628987669944763
0 references
0.8411927223205566
0 references
0.8028314709663391
0 references
0.8014628887176514
0 references
