Separation of Partition Inequalities

Given a graph $G=(V,E)$ with nonnegative weights $x(e)$ for each edge $e$, a partition inequality is of the form $x\big(\delta(S_1,...,S_p)\big)\ge a p + b$. Here $\delta(S_1,...,S_p)$ denotes the multicut defined by a partition $S_1,...,S_p$ of $V$. We give a polynomial algorithm for the associated separation problem. This is based on an algorithm for finding the minimum of $x\big(\delta(S_1,...,S_p)\big)-p$ that reduces to minimizing a symmetric submodular function. This is handled with the recent algorithm of Queyranne.

By: Mourad Baiou, Francisco Barahona and Ali Ridha Mahjoub

Published in: RC20539 in 1996


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 .