Second-order cover inequalities
- 115 Downloads
We introduce a new class of second-order cover inequalities whose members are generally stronger than the classical knapsack cover inequalities that are commonly used to enhance the performance of branch-and-cut methods for 0–1 integer programming problems. These inequalities result by focusing attention on a single knapsack constraint in addition to an inequality that bounds the sum of all variables, or in general, that bounds a linear form containing only the coefficients 0, 1, and –1. We provide an algorithm that generates all non-dominated second-order cover inequalities, making use of theorems on dominance relationships to bypass the examination of many dominated alternatives. Furthermore, we derive conditions under which these non-dominated second-order cover inequalities would be facets of the convex hull of feasible solutions to the parent constraints, and demonstrate how they can be lifted otherwise. Numerical examples of applying the algorithm disclose its ability to generate valid inequalities that are sometimes significantly stronger than those derived from traditional knapsack covers. Our results can also be extended to incorporate multiple choice inequalities that limit sums over disjoint subsets of variables to be at most one.
KeywordsInteger programming Knapsack cover inequalities 0–1 Pre-processing Nested cuts Surrogate constraints Facets
Mathematics Subject Classification90C10 90C27
Unable to display preview. Download preview PDF.
- 9.Hanafi, S.: Contribution à la résolution de problèmes duaux de grande taille en optimisation combinatoire. Ph.D. Thesis, University of Valenciennes, France (1993)Google Scholar
- 10.Hanafi, S., Glover, F.: Exploiting nested inequalities and surrogate constraints. Research Report, University of Valenciennes, France, and University of Colorado, Boulder, CO, USA (2005)Google Scholar
- 11.Hooker, J.N.: Logic-based methods for optimization. In: Borning, A. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol. 874, pp. 336–349 (1994)Google Scholar
- 18.Spielberg, K., Guignard, M.: A sequential (Quasi) hot start method for BB (0, 1) mixed integer programming. Mathematical Programming Symposium, Atlanta, GA (2000)Google Scholar