Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
scientific article |
Statements
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (English)
0 references
19 August 2011
0 references
integer programming
0 references
combinatorial optimization
0 references
routing
0 references
network flows
0 references
