A branch-and-cut framework for the consistent traveling salesman problem (Q320686)
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 framework for the consistent traveling salesman problem |
scientific article; zbMATH DE number 6635683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut framework for the consistent traveling salesman problem |
scientific article; zbMATH DE number 6635683 |
Statements
A branch-and-cut framework for the consistent traveling salesman problem (English)
0 references
7 October 2016
0 references
traveling salesman problem
0 references
multi-period routing
0 references
service consistency
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
