Crossmark

The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Crossref DOI link: https://doi.org/10.1007/s13676-019-00141-w

Published Print: 2019-12

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Danach, Kassem

Gelareh, Shahin

Neamatian Monemi, Rahimeh https://orcid.org/0000-0001-5192-5247
Funding

Funding for this research was provided by:

Gaspard-Monge, PGMO (BENMIP)

Gaspard-Monge, PGMO (BENMIP)
License Information

Text and Data Mining valid from 2019-12-01

Text and Data Mining valid from 2019-12-01

Version of Record valid from 2020-10-20
More Information

This article is maintained by: Elsevier

Article Title: The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Journal Title: EURO Journal on Transportation and Logistics

CrossRef DOI link to publisher maintained version: https://doi.org/10.1007/s13676-019-00141-w

Content Type: article

Copyright: Copyright © 2019 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.