On the complexity of separation from the knapsack polytope

DOI10.1007/978-3-031-06901-7_13zbMath1497.90130arXiv2111.06556MaRDI QIDQ2164691

Jeff Linderoth, Alberto Del Pia, Haoran Zhu

Publication date: 16 August 2022

Full work available at URL: https://arxiv.org/abs/2111.06556

zbMATH Keywords

complexity theory; separation problem; knapsack polytope

Mathematics Subject Classification ID

90C10: Integer programming

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization