García-Quiles, Sergio, Landete, Mercedes, Marín, Alfredo (2012) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. European Journal of Operational Research, 220 (1). pp. 48-57. ISSN 0377-2217. (doi:10.1016/j.ejor.2012.01.042) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30838)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1016/j.ejor.2012.01.042 |
Abstract
This article deals with the uncapacitated multiple allocation p-hub median problem, where p facilities (hubs) must be located among n available sites in order to minimize the transportation cost of sending a product between all pairs of sites. Each path between an origin and a destination can traverse any pair of hubs. For the first time in the literature, an integer programming formulation with O(n 2) variables has been devised to approach this problem. Based on this formulation, a branch-and-cut algorithm has been developed which allows to solve larger instances than those previously solved in the literature. The proposed algorithm performs specially well for relatively large values of p. © 2012 Elsevier B.V. All rights reserved.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/j.ejor.2012.01.042 |
Additional information: | Unmapped bibliographic data: PY - 2012/// [EPrints field already has value set] AD - Departamento de EstadÃstica, Universidad Carlos III de Madrid, Spain [Field not mapped to EPrints] AD - Departamento de EstadÃstica, Matemáticas e Informática, Universidad Miguel Hernández de Elche, Spain [Field not mapped to EPrints] AD - Departamento de EstadÃstica e Investigación Operativa, Universidad de Murcia, Spain [Field not mapped to EPrints] JA - Eur J Oper Res [Field not mapped to EPrints] |
Uncontrolled keywords: | Discrete location, Hub location, Integer programming, Branch-and-cut algorithms, Discrete location, Hub location, Integer programming formulations, Median problem, Multiple allocation, Transportation cost, Integer programming, Algorithms |
Subjects: | H Social Sciences > HA Statistics > HA33 Management Science |
Divisions: | Divisions > Kent Business School - Division > Department of Marketing, Entrepreneurship and International Business |
Depositing User: | Catherine Norman |
Date Deposited: | 21 Sep 2012 10:39 UTC |
Last Modified: | 16 Nov 2021 10:08 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/30838 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):