On the p-Median Polytope of Fork-free Graphs

We study a prize collecting version of the uncapacitated facility location problem and of the p-median problem. We say that the uncapacitated facility location polytope has the intersection property, if adding the extra equation that fixes the number of opened facilities does not create any fractional extreme point. We show that this property holds if and only if the graph has no fork. A fork is a particular subgraph. We give a complete description of the polytope for this class of graphs.

By: Mourad Baïou; Francisco Barahona; Jose Correa

Published in: RC25072 in 2010


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .