Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
scientific article; zbMATH DE number 5940378
| 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; zbMATH DE number 5940378 |
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
0 references
0 references
0 references
0 references
0 references
