Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640)
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: Minimum directed 1-subtree relaxation for score orienteering problem |
scientific article; zbMATH DE number 1299859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum directed 1-subtree relaxation for score orienteering problem |
scientific article; zbMATH DE number 1299859 |
Statements
Minimum directed 1-subtree relaxation for score orienteering problem (English)
0 references
22 February 2001
0 references
orienteering problem
0 references
minimum directed 1-subtree relaxation
0 references
traveling salesman problem
0 references
0 references
