Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456)
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 5377416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines |
scientific article; zbMATH DE number 5377416 |
Statements
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (English)
0 references
4 December 2008
0 references
traveling salesman problem
0 references
deadlines
0 references
heuristics
0 references
stochastic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8561748266220093
0 references
0.8400192260742188
0 references
0.8331165909767151
0 references
0.7576237916946411
0 references
0.7559073567390442
0 references
