A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103)
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 5818757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem |
scientific article; zbMATH DE number 5818757 |
Statements
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (English)
0 references
24 November 2010
0 references
prize collecting traveling salesman problem
0 references
branch-and-cut
0 references
valid inequalities
0 references
0.8569385409355164
0 references
0.8429596424102783
0 references
0.8156772255897522
0 references
