中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共3条，第1-3条 帮助

限定条件    
已选(0)清除 条数/页：   排序方式：
On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
作者:  Chen, Wei-Kun;  Dai, Yu-Hong
收藏  |  浏览/下载：125/0  |  提交时间：2020/05/24
integer programming  sequentially lifted cover inequality  complexity  lifting problem  
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2020, 卷号: 76, 期号: 4, 页码: 913-932
作者:  Jarre, Florian;  Lieder, Felix;  Liu, Ya-Feng;  Lu, Cheng
收藏  |  浏览/下载：132/0  |  提交时间：2020/05/24
Max-cut problem  Complex variables  Semidefinite relaxation  Unit modulus lifting  
A ROBUST INTERIOR POINT METHOD FOR COMPUTING THE ANALYTIC CENTER OF AN ILL-CONDITIONED POLYTOPE WITH ERRORS 期刊论文
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2019, 卷号: 37, 期号: 6, 页码: 843-865
作者:  Wang, Zhouhong;  Dai, Yuhong;  Xu, Fengmin
收藏  |  浏览/下载：147/0  |  提交时间：2020/05/24
Analytic center  Ill-conditioning  Unboundedness  Primal-dual interior point algorithm  Convergence  Polynomial complexity