Strong linear programming relaxations for the orienteering problem (Q1328645): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 02:54, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong linear programming relaxations for the orienteering problem |
scientific article |
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
