On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of the probabilistic traveling salesman problem with deadlines |
scientific article |
Statements
On the computational complexity of the probabilistic traveling salesman problem with deadlines (English)
0 references
6 June 2014
0 references
stochastic combinatorial optimization
0 references
stochastic vehicle routing
0 references
computational complexity
0 references
inapproximability
0 references
0 references
0 references
0 references
0 references
0 references
0 references
