On the separation of split cuts and related inequalities

On the separation of split cuts and related inequalities

0.00 Avg rating0 Votes
Article ID: iaor20041245
Country: Germany
Volume: 94
Issue: 2/3
Start Page Number: 279
End Page Number: 294
Publication Date: Jan 2003
Journal: Mathematical Programming
Authors: ,
Keywords: programming: integer
Abstract:

The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer programming which include a variety of other well-known cuts as special cases. To detect violated split cuts, one has to solve the associated separation problem. The complexity of split cut separation was recently cited as an open problem by Cornuéjols & Li. In this paper we settle this question by proving strong NP-completeness of separation for split cuts. As a by-product we also show NP-completeness of separation for several other classes of inequalities, including the MIR-inequalities of Nemhauser and Wolsey and some new inequalities which we call balanced split cuts and binary split cuts. We also strengthen NP-completeness results of Caprara & Fischetti (for {0,1/2}-cuts) and Eisenbrand (for Chvátal–Gomory cuts). To compensate for this bleak picture, we also give a positive result for the Symmetric Travelling Salesman Problem. We show how to separate in polynomial time over a class of split cuts which includes all comb inequalities with a fixed handle.

Reviews

Required fields are marked *. Your email address will not be published.