RT journal article
T1 A new formulation and branch-and-cut method for single-allocation hub location problems
A1 Espejo Miranda, Inmaculada
A1 Marín, Alfredo
A1 Muñoz Ocaña, Juan Manuel
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Branch-and-cut
K1 Discrete optimization
K1 Hub location
K1 Single allocation
AB A new compact formulation for uncapacitated single-allocation hub location problems with fewer variables than the previous Integer Linear Programming formulations in the literature is introduced. Our formulation works even with costs not based on distances and not satisfying triangle inequality. Moreover, costs can be given in aggregated or disaggregated way. Different families of valid inequalities that strengthen the formulation are developed and a branch-and-cut algorithm based on a relaxed version of the formulation is designed, whose restrictions are inserted in a cut generation procedure together with two sets of valid inequalities. The performance of the proposed methodology is tested on well-known hub location data sets and compared to the most recent and efficient exact algorithms for single-allocation hub location problems. Extensive computational results prove the efficiency of our methodology, that solves large-scale instances in very competitive times.
PB Elsevier
SN 0305-0548
YR 2023
FD 2023-04-10
LK http://hdl.handle.net/10498/28792
UL http://hdl.handle.net/10498/28792
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 07-nov-2026