On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174)
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 6301575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the probabilistic traveling salesman problem with deadlines |
scientific article; zbMATH DE number 6301575 |
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
0.9564282298088074
0 references
0.834290623664856
0 references
0.8331165909767151
0 references
0.7498143911361694
0 references
0.742823600769043
0 references
