Solving Large p‐Median Problems with a Radius Formulation

Solving Large p‐Median Problems with a Radius Formulation

0.00 Avg rating0 Votes
Article ID: iaor201111053
Volume: 23
Issue: 4
Start Page Number: 546
End Page Number: 556
Publication Date: Sep 2011
Journal: INFORMS Journal on Computing
Authors: , ,
Keywords: programming: branch and bound, location
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.

Reviews

Required fields are marked *. Your email address will not be published.