A strong formulation for Multiple Allocation Hub Location based on supermodular inequalities
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915585433010176 |
|---|---|
| author | Fernández, Elena Zerega, Nicolás |
| author_facet | Fernández, Elena Zerega, Nicolás |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_25490 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A strong formulation for Multiple Allocation Hub Location based on supermodular inequalities Fernández, Elena Zerega, Nicolás Optimization and Control 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. |
| title | A strong formulation for Multiple Allocation Hub Location based on supermodular inequalities |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.25490 |