On the power of lookahead in on-line server routing problems (Q959800)
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 5382268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the power of lookahead in on-line server routing problems |
scientific article; zbMATH DE number 5382268 |
Statements
On the power of lookahead in on-line server routing problems (English)
0 references
12 December 2008
0 references
on-line algorithms
0 references
competitive analysis
0 references
lookahead
0 references
traveling salesman problem
0 references
0.8834127187728882
0 references
0.8350400924682617
0 references
0.8035584092140198
0 references
0.8035584092140198
0 references
0.793224573135376
0 references
