Home > Research > Publications & Outputs > On disjunctive cuts for combinatorial optimization
View graph of relations

On disjunctive cuts for combinatorial optimization

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>09/2001
<mark>Journal</mark>Journal of Combinatorial Optimization
Issue number3
Number of pages17
Pages (from-to)299-315
Publication StatusPublished
<mark>Original language</mark>English


In the successful branch-and-cut approach to combinatorial optimization, linear inequalities are used as cutting planes within a branch-and-bound framework. Although researchers often prefer to use facet-inducing inequalities as cutting planes, good computational results have recently been obtained using disjunctive cuts, which are not guaranteed to be facet-inducing in general. A partial explanation for the success of the disjunctive cuts is given in this paper. It is shown that, for six important combinatorial optimization problems (the clique partitioning, max-cut, acyclic subdigraph, linear ordering, asymmetric travelling salesman and set covering problems), certain facet-inducing inequalities can be obtained by simple disjunctive techniques. New polynomial-time separation algorithms are obtained for these inequalities as a by-product. The disjunctive approach is then compared and contrasted with some other ‘general-purpose’ frameworks for generating cutting planes and some conclusions are made with respect to the potential and limitations of the disjunctive approach.