An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3991296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems |
scientific article; zbMATH DE number 3991296 |
Statements
An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (English)
0 references
1986
0 references
branch-and-bound
0 references
Multiple traveling salesman problem
0 references
Lagrangean relaxation
0 references
degree-constrained minimal spanning tree
0 references
subgradient optimization
0 references
sensitivity analysis
0 references
0.8201996088027954
0 references
0.8170652389526367
0 references
0.8155017495155334
0 references
0.8093323707580566
0 references
