Revisiting the Single Allocation Hub Location Problem.

  1. Alfredo Marín 1
  2. Inmaculada Espejo 3
  3. Juan Manuel Muñoz 2
  4. Antonio M. Rodríguez-Chía 2
  1. 1 Department of Statistics and Operational Research, University of Murcia, Spain.
  2. 2 Department of Statistics and Operational Research, University of Cádiz, Spain
  3. 3 Department of Statistics and Operational Research, University of Cádiz, Spain.
Actas:
Optimization 2023

Editorial: Universidad de Aveiro

Año de publicación: 2023

Páginas: 94

Tipo: Aportación congreso

Resumen

A formulation for the uncapacitated single-allocation hub location problem (valid also when costs are not based on distances and do not satisfy thetriangle inequality and are given in an aggregated way) with fewer variablesis presented. Adding valid inequalities to this formulation, a branch-and-cutalgorithm is designed that solves large-scale instances in very competitivetimes.