Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117)
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: Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem |
scientific article; zbMATH DE number 2127049
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem |
scientific article; zbMATH DE number 2127049 |
Statements
Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (English)
0 references
12 January 2005
0 references
Peripatetic Salesman Problem
0 references
Traveling Salesman Problem
0 references
Branch-and-cut
0 references
0 references
0 references
0 references
