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.
Fields of Study & Subjects
Vehicle Routing Optimization Methods
Advanced Optimization Algorithms Research
VLSI and FPGA Design Techniques
Publication details
- Journal / source
- Computers & Operations Research
- Volume
- 194
- Pages
- 107585–107585
- Publication date
- 17 June 2026
- Language
- EN