New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

García, S. and Landete, M. and Marín, A. (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 03772217 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://www.scopus.com/inward/record.url?eid=2-s2.0...

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
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
H Social Sciences > HA Statistics > HA33 Management Science
Divisions: Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Cathy Norman
Date Deposited: 21 Sep 2012 10:39
Last Modified: 28 Sep 2012 15:40
Resource URI: http://kar.kent.ac.uk/id/eprint/30838 (The current URI for this page, for reference purposes)
  • Depositors only (login required):