Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642)
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 6101800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines |
scientific article; zbMATH DE number 6101800 |
Statements
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (English)
0 references
2 November 2012
0 references
stochastic combinatorial optimization
0 references
stochastic vehicle routing
0 references
computational complexity
0 references
0.96156293
0 references
0.9143713
0 references
0.89977324
0 references
0.8862691
0 references
0.88016206
0 references
0.8753557
0 references
0.87164176
0 references
