中文版 | English

在结果中检索

CSpace

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

限定条件        
已选(0)清除 条数/页：   排序方式：
On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
作者:  Chen, Wei-Kun;  Dai, Yu-Hong
收藏  |  浏览/下载：127/0  |  提交时间：2020/05/24
integer programming  sequentially lifted cover inequality  complexity  lifting problem  
Generalized coefficient strengthening cuts for mixed integer programming 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2018, 卷号: 70, 期号: 1, 页码: 289-306
作者:  Chen, Wei-Kun;  Chen, Liang;  Yang, Mu-Ming;  Dai, Yu-Hong
收藏  |  浏览/下载：161/0  |  提交时间：2018/07/30
Mixed integer programming  Cutting plane method  Separation algorithm  Coefficient strengthening  
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:  Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
收藏  |  浏览/下载：109/0  |  提交时间：2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach 期刊论文
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 卷号: 63, 期号: 14, 页码: 3641-3656
作者:  Liu, Ya-Feng;  Dai, Yu-Hong;  Ma, Shiqian
收藏  |  浏览/下载：111/0  |  提交时间：2018/07/30
Admission control  complexity  non-convex approximation  potential reduction algorithm  power control  sparse optimization