Optimal upgrading schemes for effective shortest paths in networks (Q2815128)
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 6598680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal upgrading schemes for effective shortest paths in networks |
scientific article; zbMATH DE number 6598680 |
Statements
Optimal Upgrading Schemes for Effective Shortest Paths in Networks (English)
0 references
27 June 2016
0 references
optimal path problem, branch-and-cut, Benders decomposition
0 references
0.8972765207290649
0 references
0.7666730284690857
0 references
0.7529695630073547
0 references
