On disjunctive cuts for combinatorial optimization

Letchford, A. N. (2001) On disjunctive cuts for combinatorial optimization. Journal of Combinatorial Optimization, 5 (3). pp. 299-315. ISSN 1382-6905

Full text not available from this repository.


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.

Item Type: Journal Article
Journal or Publication Title: Journal of Combinatorial Optimization
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Departments: Lancaster University Management School > Management Science
ID Code: 43617
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:02
Refereed?: Yes
Published?: Published
Last Modified: 01 Jan 2020 07:23
URI: https://eprints.lancs.ac.uk/id/eprint/43617

Actions (login required)

View Item View Item