Facets from gadgets

Letchford, Adam and Vu, Anh (2019) Facets from gadgets. Mathematical Programming. ISSN 0025-5610

[img]
Text (gadgets)
gadgets.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (346kB)

Abstract

We present a new tool for generating cutting planes for NP-hard combinatorial optimisation problems. It is based on the concept of gadgets — small subproblems that are “glued” together to form hard problems — which we borrow from the literature on computational complexity. Using gadgets, we are able to derive huge (exponentially large) new families of strong (and sometimes facet-defining) cutting planes, accompanied by efficient separation algorithms. We illustrate the power of this approach on the asymmetric traveling salesman, stable set and clique partitioning problems.

Item Type:
Journal Article
Journal or Publication Title:
Mathematical Programming
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600
Subjects:
ID Code:
136540
Deposited By:
Deposited On:
06 Sep 2019 13:30
Refereed?:
Yes
Published?:
Published
Last Modified:
20 Sep 2020 05:43