{"ID":2848581,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.25490","arxiv_id":"2510.25490","title":"A strong formulation for Multiple Allocation Hub Location based on supermodular inequalities","abstract":"We introduce a new formulation for the multiple allocation hub location problem that exploits supermodular properties and uses 1- and 2-index variables only. We show that the new formulation produces the same Linear Programming bound as the tightest existing formulations for the studied problem, which use 4-index variables, outperforming existing supermodular formulations adapted to the considered problem. Computational results are presented with instances of up to 200 nodes optimally solved within a time limit of two hours.","short_abstract":"We introduce a new formulation for the multiple allocation hub location problem that exploits supermodular properties and uses 1- and 2-index variables only. We show that the new formulation produces the same Linear Programming bound as the tightest existing formulations for the studied problem, which use 4-index varia...","url_abs":"https://arxiv.org/abs/2510.25490","url_pdf":"https://arxiv.org/pdf/2510.25490v1","authors":"[\"Elena Fernández\",\"Nicolás Zerega\"]","published":"2025-10-29T13:09:23Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}