2000 character limit reached
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Published 25 Nov 2018 in math.OC | (1811.10010v2)
Abstract: The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover inequality can be computed in polynomial time for a given minimal cover (Gu, Nemhauser, and Savelsbergh, INFORMS J. Comput., 26: 117--123, 1999). We show that this problem is NP-hard, thus giving a negative answer to the question.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.