Computers and Industrial Engineering - Supply chain management
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming: Series A and B
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Journal of Global Optimization
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
SIAM Journal on Discrete Mathematics
Exact procedures for solving the discrete ordered median problem
Computers and Operations Research
A hub covering model for cargo delivery systems
Networks - Special Issue on Multicommodity Flows and Network Design
Solving the hub location problem in a star–star network
Networks - Special Issue In Memory of Stefano Pallottino
A flexible model and efficient solution strategies for discrete location problems
Discrete Applied Mathematics
A 2-phase algorithm for solving the single allocation p-hub center problem
Computers and Operations Research
Formulating and solving splittable capacitated multiple allocation hub location problems
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Single-allocation ordered median hub location problems
Computers and Operations Research
Twenty-Five Years of Hub Location Research
Transportation Science
Operations Research Letters
| Hi-index | 0.04 |
The Single-Allocation Ordered Median Hub Location problem is a recent hub model introduced by Puerto et al. (2011) [32] that provides a unifying analysis of the class of hub location models. Indeed, considering ordered objective functions in hub location models is a powerful tool in modeling classic and alternative location paradigms, that can be applied with success to a large variety of problems providing new distribution patterns induced by the different users' roles within the supply chain network. In this paper, we present a new formulation for the Single-Allocation Ordered Median Hub Location problem and a branch-and-bound-and-cut (B&B&Cut) based algorithm to solve optimally this model. A simple illustrative example is discussed to demonstrate the technique, and then a battery of test problems with data taken from the AP library are solved. The paper concludes that the proposed B&B&Cut approach performs well for small to medium sized problems.