Strong linear programming relaxations for the orienteering problem (Q1328645)
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: Strong linear programming relaxations for the orienteering problem |
scientific article; zbMATH DE number 611363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong linear programming relaxations for the orienteering problem |
scientific article; zbMATH DE number 611363 |
Statements
Strong linear programming relaxations for the orienteering problem (English)
0 references
1 March 1995
0 references
relaxation
0 references
routing
0 references
orienteering problem
0 references
0-1 integer program
0 references
NP-hard
0 references
upper bounds
0 references
0.8082275986671448
0 references
0.805302083492279
0 references
0.7769253849983215
0 references
0.7732082009315491
0 references
0.7583263516426086
0 references
