Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162)
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: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6872087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6872087 |
Statements
Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (English)
0 references
24 May 2018
0 references
traveling salesman problem
0 references
multiple stacks
0 references
polyhedral study
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
