12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Binary clutter inequalities for integer programs
View graph of relations

« Back

Binary clutter inequalities for integer programs

Research output: Contribution to journalJournal article

Published

Journal publication date2003
JournalMathematical Programming
Journal number1-3
Volume98
Number of pages21
Pages201-221
Original languageEnglish

Abstract

We introduce a new class of valid inequalities for general integer linear programs, called binary clutter (BC) inequalities. They include the {0, 1/2}-cuts of Caprara and Fischetti as a special case and have some interesting connections to binary matroids, binary clutters and Gomory corner polyhedra. We show that the separation problem for BC-cuts is strongly NP-hard in general, but polynomially solvable in certain special cases. As a by-product we also obtain new conditions under which {0, 1/2}-cuts can be separated in polynomial time. These ideas are then illustrated using the Traveling Salesman Problem (TSP) as an example. This leads to an interesting link between the TSP and two apparently unrelated problems, the T -join and max-cut problems.