A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 11:32, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem |
scientific article |
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