Introduction to Logistics Systems Planning and Control
Introduction to Logistics Systems Planning and Control
Branch and peg algorithms for the simple plant location problem
Computers and Operations Research
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
A New Formulation and Resolution Method for the p-Center Problem
INFORMS Journal on Computing
Solving the p-Median Problem with a Semi-Lagrangian Relaxation
Computational Optimization and Applications
Computational study of large-scale p-Median problems
Mathematical Programming: Series A and B
The Optimal Diversity Management Problem
Operations Research
A strengthened formulation for the simple plant location problem with order
Operations Research Letters
Operations Research Letters
An aggregation heuristic for large scale p-median problem
Computers and Operations Research
A mixed integer linear model for clustering with variable selection
Computers and Operations Research
| Hi-index | 0.00 |
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.