The Multi-Depot Routing Allocation Problem (Q3760267): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58117364, #quickstatements; #temporary_batch_1711565664090 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3858010 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implementing vehicle routing algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem / rank | |||
Normal rank | |||
Latest revision as of 09:38, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Multi-Depot Routing Allocation Problem |
scientific article |
Statements
The Multi-Depot Routing Allocation Problem (English)
0 references
1987
0 references
multi-depot routing allocation
0 references
multiple capacitated depots
0 references
heuristic
0 references
two-phase method
0 references
vehicle routing
0 references
