A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
Crossref DOI link: https://doi.org/10.1007/s10479-018-2938-4
Published Online: 2018-07-07
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Henke, Tino http://orcid.org/0000-0003-4245-1873
Speranza, M. Grazia
Wäscher, Gerhard
Text and Data Mining valid from 2018-07-07
Article History
First Online: 7 July 2018