A new formulation and a branch-and-cut algorithm for the set orienteering problem (Q6128935)
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 7833038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new formulation and a branch-and-cut algorithm for the set orienteering problem |
scientific article; zbMATH DE number 7833038 |
Statements
A new formulation and a branch-and-cut algorithm for the set orienteering problem (English)
0 references
16 April 2024
0 references
routing
0 references
orienteering problem
0 references
integer linear programming
0 references
branch-and-cut
0 references
