The p-hub center allocation problem
- 1 January 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 176 (2), 819-835
- https://doi.org/10.1016/j.ejor.2005.09.024
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Algorithms for solving the conditional covering problem on pathsNaval Research Logistics (NRL), 2005
- On the single-assignment p-hub center problemEuropean Journal of Operational Research, 2000
- The capacitated multiple allocation hub location problem: Formulations and algorithmsEuropean Journal of Operational Research, 2000
- Efficient solution procedure and reduced size formulations for p-hub location problemsEuropean Journal of Operational Research, 1998
- A hybrid heuristic for the uncapacitated hub location problemEuropean Journal of Operational Research, 1998
- Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 1996
- A dual algorithm for the uncapacitated hub location problemLocation Science, 1996
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- The generalizedP-forest problem on a tree networkNetworks, 1992
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987