Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:54, 3 February 2024
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
