Binary clutter inequalities for integer programs

Letchford, A N (2002) Binary clutter inequalities for integer programs. Working Paper. The Department of Management Science, Lancaster University.

Full text not available from this repository.

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 Travelling 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.

Item Type:
Monograph (Working Paper)
Additional Information:
This was eventually published as: A.N. Letchford (2003) Binary clutter inequalities for integer programs. Math. Program., 98(1-3), 201-221.
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
48638
Deposited By:
Deposited On:
11 Jul 2011 21:04
Refereed?:
No
Published?:
Published
Last Modified:
24 May 2020 23:47