Solving Large p-median Problems with a Radius Formulation

García-Quiles, Sergio and Labbé, Martine and Marín, Alfredo (2011) Solving Large p-median Problems with a Radius Formulation. INFORMS Journal on Computing, 23 (4). pp. 546-556. ISSN 10919856 . (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://dx.doi.org/10.1287/ijoc.1100.0418

Abstract

By means of a model based on a set covering formulation, it is shown how the p-median problem can be solved with just a column generation approach that is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances that have been optimally solved. In particular, problems of a size larger than the largest ones considered in the literature up to now are solved exactly in this paper. © 2011 INFORMS.

Item Type: Article
Additional information: Unmapped bibliographic data: PY - 2011/// [EPrints field already has value set] AD - Departamento de Estadística, Universidad Carlos III de Madrid, 28911 Leganés (Madrid), Spain [Field not mapped to EPrints] AD - Departément D'Informatique, Université Libre de Bruxelles, B-1050 Brussels, Belgium [Field not mapped to EPrints] AD - Departamento de Estadística e Investigación Operativa, Universidad de Murcia, 30100 Espinardo (Murcia), Spain [Field not mapped to EPrints] JA - INFORMS J. Comput. [Field not mapped to EPrints]
Uncontrolled keywords: Column-and-row generation, Discrete location, P-median
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 11:17
Last Modified: 16 Jun 2014 15:08
Resource URI: http://kar.kent.ac.uk/id/eprint/30840 (The current URI for this page, for reference purposes)
  • Depositors only (login required):