On the complexity of sequentially lifting cover inequalities for the knapsack polytope

doi:10.1007/s11425-019-9538-1

CSpace

	On the complexity of sequentially lifting cover inequalities for the knapsack polytope
	Chen, Wei-Kun 1,2,3; Dai, Yu-Hong 2,3
	2020-04-15
发表期刊	SCIENCE CHINA-MATHEMATICS
ISSN	1674-7283
页码	10
摘要	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.
关键词	integer programming sequentially lifted cover inequality complexity lifting problem
DOI	10.1007/s11425-019-9538-1
收录类别	SCI
语种	英语
资助项目	National Natural Science Foundation of China[11631013] ; National Natural Science Foundation of China[11331012] ; National Basic Research Program of China[2015CB856002] ; Major Project to Promote Development of Big Data from National Development and Reform Commission[2016-999999-65-01-000696-01]
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000526333200002
出版者	SCIENCE PRESS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/51191
专题	中国科学院数学与系统科学研究院
通讯作者	Dai, Yu-Hong
作者单位	1.Beijing Inst Technol, Sch Math & Stat, Beijing 100081, Peoples R China 2.Chinese Acad Sci, LSEC, ICMSEC, Acad Math & Syst Sci, Beijing 100190, Peoples R China 3.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
推荐引用方式 GB/T 7714	Chen, Wei-Kun,Dai, Yu-Hong. On the complexity of sequentially lifting cover inequalities for the knapsack polytope[J]. SCIENCE CHINA-MATHEMATICS,2020:10.
APA	Chen, Wei-Kun,&Dai, Yu-Hong.(2020).On the complexity of sequentially lifting cover inequalities for the knapsack polytope.SCIENCE CHINA-MATHEMATICS,10.
MLA	Chen, Wei-Kun,et al."On the complexity of sequentially lifting cover inequalities for the knapsack polytope".SCIENCE CHINA-MATHEMATICS (2020):10.