Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a
success story in large-scale integer programming. We outline and relate the approaches …

The p‐median problem is a network problem that was originally designed for, and has been
extensively applied to, facility location. In this bibliography, we summarize the literature on …

Given n customers and a set F of m potential facilities, the p-median problem consists in
finding a subset of F with p facilities such that the cost of serving all customers is minimized …

Given a directed graph G (V, A), the p-Median problem consists of determining p nodes (the
median nodes) minimizing the total distance from the other nodes of the graph. We present a …

In this paper we propose heuristic algorithms for the capacitated p-median problem. In the
first one solutions are obtained with Scatter Search whereas the second algorithm uses Path …

This article develops several strategies for the parallelization of the metaheuristic called
scatter search, which is a population-based method that constructs solutions by combining …

We present a new implementation of a widely used swap-based local search procedure for
the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same …

This paper describes a branch-and-price algorithm for the p-median location problem. The
objective is to locate p facilities (medians) such as the sum of the distances from each …

Given n customers and a set F of m potential facilities, the p-median problem consists in
finding a subset of F with p facilities such that the cost of serving all customers is minimized …

This article presents a column generation algorithm to calculate new improved lower bounds
to the solution of maximal covering location problems formulated as ap‐median problem …