AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817)
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 2204128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES |
scientific article; zbMATH DE number 2204128 |
Statements
AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (English)
0 references
9 September 2005
0 references
Integer L-shaped method
0 references
time-constrained traveling salesman problem
0 references
stochastic program with recourse
0 references
Benders' decomposition
0 references
0 references
0 references
0.8096511363983154
0 references
0.790695309638977
0 references
0.7678999304771423
0 references
0.7640421390533447
0 references
