On approximating a geometric prize-collecting traveling salesman problem with time windows (Q4675490): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2003.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072592433 / rank | |||
Normal rank | |||
Latest revision as of 20:26, 19 March 2024
scientific article; zbMATH DE number 2165452
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
