On the Complexity of Separation from the Knapsack Polytope

Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu. On the Complexity of Separation from the Knapsack Polytope. In Karen Aardal, Laura Sanità, editors, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Volume 13265 of Lecture Notes in Computer Science, pages 168-180, Springer, 2022. [doi]

Abstract

Abstract is missing.