Computing compatible tours for the symmetric traveling salesman problem (Q542055)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing compatible tours for the symmetric traveling salesman problem |
scientific article; zbMATH DE number 5905303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing compatible tours for the symmetric traveling salesman problem |
scientific article; zbMATH DE number 5905303 |
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
