A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232)
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: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem |
scientific article; zbMATH DE number 1091516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem |
scientific article; zbMATH DE number 1091516 |
Statements
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (English)
0 references
1 September 1998
0 references
clustered notes
0 references
symmetric traveling salesman
0 references
generalized traveling salesman
0 references
location-routing
0 references
integer linear program
0 references
facial structure
0 references
polytopes
0 references
heuristic separation procedures
0 references
branch-and-cut
0 references
0.9321078658103944
0 references
0.8281003832817078
0 references
0.8208670020103455
0 references
0.819117546081543
0 references
0.8127814531326294
0 references
