A Combinatorial Algorithm for Facility Location with No G-odd Cycles

In [1] we had proved that the linear relaxation of a facility location model defines an integral polytope if and only if the graph has no g-odd cycles. Here we give a combinatorial algorithm for facility location in this class of graphs.

By: Mourad Baïou; Francisco Barahona

Published in: RC25232 in 2011


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 .