Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 18:37, 29 February 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
