García, S. and Labbé, M. and Marín, A. (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. (Contact us about this Publication)|
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.
|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:||15 Oct 2012 08:20|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/30840 (The current URI for this page, for reference purposes)|
- Depositors only (login required):