Computing compatible tours for the symmetric traveling salesman problem (Q542055)
From MaRDI portal
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
