A heuristic and lower bound for a multi-depot routing problem (Q1905085): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implementing vehicle routing algorithms / rank | |||
Normal rank | |||
Latest revision as of 08:14, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic and lower bound for a multi-depot routing problem |
scientific article |
Statements
A heuristic and lower bound for a multi-depot routing problem (English)
0 references
25 February 1996
0 references
multi-depot routing problem
0 references
heuristic
0 references
