Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.037 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982862520 / rank | |||
Normal rank |
Revision as of 02:39, 20 March 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