A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732)
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: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem |
scientific article; zbMATH DE number 6395832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem |
scientific article; zbMATH DE number 6395832 |
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
0 references
0 references
0 references
0 references
0 references
0.9259456992149352
0 references
0.8824847936630249
0 references
0.8377018570899963
0 references
0.8350251913070679
0 references
0.8348554968833923
0 references
