A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922)
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: A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem |
scientific article; zbMATH DE number 6170497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem |
scientific article; zbMATH DE number 6170497 |
Statements
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (English)
0 references
4 June 2013
0 references
branch-and-cut
0 references
dominance property
0 references
incompatibility
0 references
clique cut
0 references
0.99824965
0 references
0.9429592
0 references
0 references
0.9232166
0 references
0.9151646
0 references
0.9097813
0 references
0.90202016
0 references
0.90157866
0 references
0.90111744
0 references
