Adapting polyhedral properties from facility to hub location problems
Authors:
- Horst W. HamacherHHHorst W. Hamacher
- Martine LabbéMLMartine Labbé
- Stefan NickelSNStefan Nickel
- Tim SonnebornTSTim Sonneborn
- 1 December 2004
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 145 (1) , 104-116
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the facets of the simple plant location packing polytopeDiscrete Applied Mathematics, 2002
- New facets for the set packing polytopeOperations Research Letters, 2000
- The capacitated multiple allocation hub location problem: Formulations and algorithmsEuropean Journal of Operational Research, 2000
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 1998
- A linear program for the two-hub location problemEuropean Journal of Operational Research, 1997
- Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 1996
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983