Sequence independent lifting of cover inequalities

DOI10.1007/3-540-59408-6_72zbMath1500.90030OpenAlexW1939041916MaRDI QIDQ5101436

Zonghao Gu, Nemhauser, George I., Savelsbergh, Martin W. P.

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_72

zbMATH Keywords

valid inequalitylifting coefficient

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

\(O(n \log n)\) procedures for tightening cover inequalities, An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.

Cites Work

• Unnamed Item
• Valid inequalities for mixed 0-1 programs
• Some polyhedra related to combinatorial problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Lifting the facets of zero–one polytopes
• Facets of the knapsack polytope
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Facets of the Knapsack Polytope From Minimal Covers
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• On the facial structure of set packing polyhedra