Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines |
scientific article |
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
