Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
Crossref DOI link: https://doi.org/10.1007/s10100-017-0489-4
Published Online: 2017-09-11
Published Print: 2019-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Horváth, Markó
Kis, Tamás http://orcid.org/0000-0002-2759-1264
Funding for this research was provided by:
Országos Tudományos Kutatási Alapprogramok (112881)
Text and Data Mining valid from 2017-09-11