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; zbMATH DE number 7165524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the target visitation problem |
scientific article; zbMATH DE number 7165524 |
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
0.89668435
0 references
0.88625324
0 references
0.8842554
0 references
0.8803334
0 references
0.87932295
0 references
0.87820804
0 references
0 references
0.87422144
0 references
