The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246)
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 5003686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations |
scientific article; zbMATH DE number 5003686 |
Statements
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (English)
0 references
6 February 2006
0 references
Combined facility location and routing
0 references
Minimum K-tree
0 references
Multiple traveling salesmen
0 references
Multiple service frequency
0 references
Split delivery
0 references
Minimum spanning forest
0 references
Clarke-Wright heuristic
0 references
0 references
0 references
0.7828511595726013
0 references
0.7713209986686707
0 references
0.7621017694473267
0 references
0.7600550055503845
0 references
