On tightening cover induced inequalities

DOI10.1016/0377-2217(92)90085-NzbMath0767.90051MaRDI QIDQ1199516

Laureano Fernando Escudero Bueno, Brenda L. Dietrich

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

cliques0-1 knapsack constraintstightening cover induced inequalities

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items

On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function ⋮ Knapsack polytopes: a survey ⋮ \(O(n \log n)\) procedures for tightening cover inequalities ⋮ Some of my favorite integer programming applications at IBM ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates ⋮ On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint ⋮ A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems ⋮ A conditional logic approach for strengthening mixed 0-1 linear programs ⋮ Logical processing for integer programming

Cites Work

• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• Easily Computable Facets of the Knapsack Polytope
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Lifting the facets of zero–one polytopes
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Coefficient reduction for inequalities in 0–1 variables
• Technical Note—A Note on Zero-One Programming
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Facets of the Knapsack Polytope From Minimal Covers
• Properties of vertex packing and independence system polyhedra
• Bounds for stochastic convex programs
• On the facial structure of set packing polyhedra

This page was built for publication: On tightening cover induced inequalities