A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20307 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4250280589 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 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
