Upgrading nodes in tree-shaped hub location
V. Blanco, A. Marín
We introduce here the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem and the Minimum Cost Spanning Tree Problem with Upgraded nodes. In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations for the problem, tighten the formulations and generate several families of valid inequalities for them. A computational study is presented showing the improvements attained with the strengthening of the formulations and comparing them.
Palabras clave / Keywords: localización discreta, localización de concentradores, programación lineal entera mixta
Programado
Sesión GT04-1: Localización (GELOCA-1). Organizador: Antonio Manuel Rodríguez Chía
29 de mayo de 2018 15:20
Sala 3
Otros trabajos en la misma sesión
M. Albareda Sambola, E. Fernández Aréizaga, F. Saldanha da Gama
V. Rebillas Loredo, M. Albareda Sambola
M. Albareda Sambola, L. Martínez Merino, A. M. Rodríguez Chía
Últimas noticias
-
04/06/18
Certificados -
13/04/18
Resumen del programa y Programa detallado -
22/03/18
Descuentos en medios de trasporte para congresistas y acompañantes -
01/02/18
Ampliación del plazo de tarifa superreducida -
19/01/18
Ampliación de plazos -
15/01/18
Programación para el día 29 de mayo -
15/01/18
Conferenciantes plenarios -
12/01/18
Sede: Palacio de Congresos -
24/12/17
Sesión plenaria en memoria del Profesor Pedro Gil -
24/12/17
Corrección bases del Premio Ramiro Melendreras