Lower and upper bounds for the two-echelon capacitated location-routing problem

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also...

Descripción completa

Detalles Bibliográficos
Autores principales: Contardo, Claudio, Hemmelmayr, Vera, Crainic, Teodor Gabriel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Pergamon Press 2012
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3916792/
https://www.ncbi.nlm.nih.gov/pubmed/24511176
http://dx.doi.org/10.1016/j.cor.2012.04.003

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3916792/
https://www.ncbi.nlm.nih.gov/pubmed/24511176
http://dx.doi.org/10.1016/j.cor.2012.04.003

Ejemplares similares