Pitch, extension complexity, and covering problems
type: Item
instance of: scholarly article
title: Pitch, extension complexity, and covering problems
author: Yuri Faenza
author: Xuan Zhang
author: Daniel Bienstock
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7443027
zbMATH Keywords: minimum knapsack
zbMATH Keywords: covering problem
zbMATH Keywords: bounded pitch
zbMATH Keywords: separation algorithm
zbMATH Keywords: extension complexity
MaRDI profile type: Publication
full work available at URL: j.orl.2021.03.006
OpenAlex ID: W3152027881
cites work: On the extension complexity of combinatorial polytopes
cites work: Subset Algebra Lift Operators for 0-1 Integer Programming
cites work: Approximate fixed-rank closures of covering problems
cites work: Q4952606
cites work: Integer Programming
cites work: Combinatorial optimization. Packing and covering
cites work: The cut polytope and the Boolean quadric polytope
cites work: Nondeterministic Quantum Query and Communication Complexities
cites work: Strengthening convex relaxations of 0/1-sets using Boolean formulas
cites work: Exponential lower bounds for polytopes in combinatorial optimization
cites work: The complexity of cover inequality separation
cites work: High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
cites work: Symmetry Matters for Sizes of Extended Formulations
cites work: Q4607993
cites work: Expressing combinatorial optimization problems by linear programs
DOI: 10.1016/J.ORL.2021.03.006
description: scientific article; zbMATH DE number 7443027