Multi-depot multiple TSP: a polyhedral study and computational results (Q367624)
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: Multi-depot multiple TSP: a polyhedral study and computational results |
scientific article; zbMATH DE number 6208483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-depot multiple TSP: a polyhedral study and computational results |
scientific article; zbMATH DE number 6208483 |
Statements
Multi-depot multiple TSP: a polyhedral study and computational results (English)
0 references
16 September 2013
0 references
multiple depot traveling salesman problem
0 references
polyhedral study
0 references
Branch-and-Cut
0 references
0 references
0 references
0 references
0 references
0.8880541324615479
0 references
0.836880087852478
0 references
0.8209159970283508
0 references
0.8071418404579163
0 references
0.8040627241134644
0 references
