A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732): 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.2013.08.032 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058742972 / rank | |||
Normal rank | |||
Revision as of 02:40, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem |
scientific article |
Statements
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (English)
0 references
3 February 2015
0 references
routing
0 references
minimum latency
0 references
CCVRP
0 references
branch-and-cut-and-price
0 references
