The p-median polytope of restricted Y-graphs

We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median and uncapacitated facility location problems. We show that the obvious integer linear programming formulation together with the odd cycle inequalities completely describe these polytopes for the class of restricted Y-graphs. This extends our results for the class of Y-free graphs. We also obtain a characterization of both polytopes for a bidirected path.

Article

Download

View The p-median polytope of restricted Y-graphs