Computing compatible tours for the symmetric traveling salesman problem (Q542055): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-010-0021-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-010-0021-5 / rank | |||
Normal rank | |||
Latest revision as of 20:58, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing compatible tours for the symmetric traveling salesman problem |
scientific article |
Statements
Computing compatible tours for the symmetric traveling salesman problem (English)
0 references
8 June 2011
0 references
traveling salesman problem
0 references
heuristics
0 references
branch-and-cut
0 references
0 references
0 references
0 references
