A Branch & Cut algorithm for the prize-collecting capacitated location routing problem
Crossref DOI link: https://doi.org/10.1007/s11750-020-00590-x
Published Online: 2021-01-08
Published Print: 2021-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Negrotto, Daniel http://orcid.org/0000-0002-9024-8135
Loiseau, Irene
Funding for this research was provided by:
UBACyT (20020100100920)
Text and Data Mining valid from 2021-01-08
Version of Record valid from 2021-01-08
Article History
Received: 16 December 2019
Accepted: 17 December 2020
First Online: 8 January 2021