A branch-and-cut algorithm for the target visitation problem (Q2294072)
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 the target visitation problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the target visitation problem |
scientific article |
Statements
A branch-and-cut algorithm for the target visitation problem (English)
0 references
10 February 2020
0 references
traveling salesman problem
0 references
linear ordering problem
0 references
polyhedra theory
0 references
branch-and-cut
0 references
0 references
