An Optimal Algorithm for the Orienteering Tour Problem (Q4030787)
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: An Optimal Algorithm for the Orienteering Tour Problem |
scientific article; zbMATH DE number 147852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal Algorithm for the Orienteering Tour Problem |
scientific article; zbMATH DE number 147852 |
Statements
An Optimal Algorithm for the Orienteering Tour Problem (English)
0 references
1 April 1993
0 references
orienteering
0 references
traveling salesman
0 references
vehicle routing
0 references
production scheduling
0 references
NP-hard
0 references
Lagrangean relaxation
0 references
degree-constrained spanning tree procedure
0 references
0.8405742645263672
0 references
0.8349502086639404
0 references
0.8255008459091187
0 references
0.8213956356048584
0 references
