@article{e38612ac5bf84372be5acfb00009e3ef,
title = "On the complexity of sequentially lifting cover inequalities for the knapsack polytope",
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 et al. (1999)). We show that this problem is NP-hard, thus giving a negative answer to the question.",
keywords = "90C11, 90C27, complexity, integer programming, lifting problem, sequentially lifted cover inequality",
author = "Chen, {Wei Kun} and Dai, {Yu Hong}",
note = "Publisher Copyright: {\textcopyright} 2020, Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature.",
year = "2021",
month = jan,
doi = "10.1007/s11425-019-9538-1",
language = "English",
volume = "64",
pages = "211--220",
journal = "Science China Mathematics",
issn = "1674-7283",
publisher = "Science Press",
number = "1",
}