Partition Inequalities: Separation, Extensions and Network Design

Given a graph G = (V,E) with nonnegative weights x(e) for each edge e, a partition inequality is of the form . Here (S1, ..., Sp) denotes the multicut defined by a partition S1, ..., Sp of V . Partition inequalities arise as valid inequalities for optimization problems such as survivable network design problems, and play a central role in solving these problems using cutting planes. We attempt to survey some variants of these inequalities, examine different separation algorithms and discuss extensions and applications in network design and other domains.

By: Mourad Baïou; Francisco Barahona; Ali Ridha Mahjoub

Published in: RC25233 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 .