O( n log n) procedures for tightening cover inequalities

• Published in: European journal of operational research Vol. 113; no. 3; pp. 676 - 687
• Main Authors: Escudero, L.F., Garı́n, A., Pérez, G.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.03.1999; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: 0-1 program; Applied sciences; Clique; Coefficient increase; Cover; Exact sciences and technology; Flows in networks. Combinatorial problems; Knapsack constraint; Knapsack problem; Lifting; Operational research and scientific management; Operational research. Management science; Probing; Studies; 0-1 program; Cover; Probing; Clique; Coefficient increase; Lifting; Knapsack constraint; Coefficient; Zero one programming; Constraint; Dominance; Increase; Objective function; Inequality; Knapsack problem

We present two procedures for tightening cover induced inequalities in 0-1 programs by using knapsack constraints plus some other information from the program. The tightening is obtained by solving successive knapsack problems with all 0-1 objective function coefficients, and using dominance criteri...