On approximating a geometric prize-collecting traveling salesman problem with time windows (Q4675490)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On approximating a geometric prize-collecting traveling salesman problem with time windows |
scientific article; zbMATH DE number 2165452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating a geometric prize-collecting traveling salesman problem with time windows |
scientific article; zbMATH DE number 2165452 |
Statements
On approximating a geometric prize-collecting traveling salesman problem with time windows (English)
0 references
4 May 2005
0 references
scheduling problem
0 references
traveling salesman
0 references
locations
0 references
dynamic programming algorithm
0 references
0.9940527081489564
0 references
0.8042137622833252
0 references
0.8040196895599365
0 references
0.7935593724250793
0 references
