On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Crossref DOI link: https://doi.org/10.1007/s11425-019-9538-1
Published Online: 2020-04-15
Published Print: 2021-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chen, Wei-Kun
Dai, Yu-Hong
Text and Data Mining valid from 2020-04-15
Version of Record valid from 2020-04-15
Article History
Received: 9 March 2019
Accepted: 14 April 2019
First Online: 15 April 2020