中文版 | English

在结果中检索

CSpace

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

已选(0)清除 条数/页：   排序方式：
Lifting for the integer knapsack cover polyhedron 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 45
作者:  Chen, Wei-Kun;  Chen, Liang;  Dai, Yu-Hong
收藏  |  浏览/下载：75/0  |  提交时间：2023/02/07
Integer programming  Cutting plane  Sequential lifting  MIR inequality  Separation algorithm  
Parameterized Dynamic Cluster Editing 期刊论文
ALGORITHMICA, 2020, 页码: 44
作者:  Luo, Junjie;  Molter, Hendrik;  Nichterlein, Andre;  Niedermeier, Rolf
收藏  |  浏览/下载：149/0  |  提交时间：2020/09/23
Graph-based data clustering  Incremental clustering  Compromise clustering  Correlation clustering  Local search  Goal-oriented clustering  NP-hard problems  Fixed-parameter tractability  Parameterized complexity  Kernelization  Multi-choice knapsack  
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  
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
收藏  |  浏览/下载：106/0  |  提交时间：2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
Some new results on Multi-Dimension Knapsack Problem 期刊论文
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2005, 卷号: 1, 期号: 3, 页码: 315-321
作者:  Zhang, Yuzhong;  Zhang, Fan;  Cai, Maocheng
收藏  |  浏览/下载：97/0  |  提交时间：2018/07/30
Knapsack Problem  polynomial time algorithm  integer programming  approximation algorithm