No label defined (Q3787809)
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 4051377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4051377 |
Statements
1987
0 references
probabilistic traveling salesman problem
0 references
probabilistic vehicle routing
0 references
0.8606228828430176
0 references
0.853340208530426
0 references
0.8533260822296143
0 references
0.8522299528121948
0 references
[For the entire collection see Zbl 0637.00020.] A probabilistic traveling salesman problem (PTSP) is essentially a traveling salesman problem (TSP) in which the number of points to be visited in each problem instance is a random variable. We give an updated version of results obtained on this problem and present a recent work done on a generalization of the PTSP, the probabilistic vehicle routing problem (PVRP).
0 references