| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142816 | Operations Research Letters | 2008 | 4 Pages |
Abstract
Recently, Baiou and Barahona [M. Baiou, F. Barahona, On the p-median polytope of Y-free graphs. Discrete Optimization (in press, available online October 2007)] gave a characterization of the p-median polytope for Y-free graphs. In this paper, we give an alternative proof of this result by reducing the p-median problem in those graphs to a matching problem and then by building upon powerful results from the matching theory.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gautier Stauffer,