A branch-and-cut algorithm for the team orienteering problem (Q4642121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6870832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the team orienteering problem |
scientific article; zbMATH DE number 6870832 |
Statements
A branch‐and‐cut algorithm for the Team Orienteering Problem (English)
0 references
22 May 2018
0 references
team orienteering problem
0 references
two-index mathematical formulation
0 references
branch-and-cut algorithm
0 references
0.9336008429527284
0 references
0.9049720764160156
0 references
0.8707024455070496
0 references
0.855999231338501
0 references
0.8433862924575806
0 references
