Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios |
scientific article; zbMATH DE number 6692552
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios |
scientific article; zbMATH DE number 6692552 |
Statements
Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (English)
0 references
7 March 2017
0 references
reliable routing
0 references
traveling salesman problem
0 references
shortest path problem
0 references
arc failures
0 references
benders decomposition
0 references
compact formulation
0 references
0 references
0 references
0.7876126766204834
0 references
0.7824628353118896
0 references
0.7550092935562134
0 references
0.7422031760215759
0 references
