Multi-depot multiple TSP: a polyhedral study and computational results (Q367624): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: M. Dambrine / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6208483 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
multiple depot traveling salesman problem | |||
| Property / zbMATH Keywords: multiple depot traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polyhedral study | |||
| Property / zbMATH Keywords: polyhedral study / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Branch-and-Cut | |||
| Property / zbMATH Keywords: Branch-and-Cut / rank | |||
Normal rank | |||
Revision as of 13:02, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-depot multiple TSP: a polyhedral study and computational results |
scientific article |
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
