A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.08.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.08.015 / rank | |||
Normal rank | |||
Latest revision as of 01:06, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the time window assignment vehicle routing problem |
scientific article |
Statements
A branch-and-cut algorithm for the time window assignment vehicle routing problem (English)
0 references
11 July 2018
0 references
vehicle routing
0 references
time window assignment
0 references
precedence inequalities
0 references
0 references
0 references
