A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232): 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.1287/opre.45.3.378 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018269848 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 20 March 2024
scientific article; zbMATH DE number 1091516
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
