On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Optimization and Control
2019-03-12 v2
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.
Keywords
Cite
@article{arxiv.1811.10010,
title = {On the complexity of sequentially lifting cover inequalities for the knapsack polytope},
author = {Wei-Kun Chen and Yu-Hong Dai},
journal= {arXiv preprint arXiv:1811.10010},
year = {2019}
}
Comments
13 pages