中文版 | 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
收藏  |  浏览/下载：95/0  |  提交时间：2023/02/07
Integer programming  Cutting plane  Sequential lifting  MIR inequality  Separation algorithm  
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 28
作者:  Li, Jianping;  Wang, Wencheng;  Lichen, Junran;  Liu, Suding;  Pan, Pengxiang
收藏  |  浏览/下载：80/0  |  提交时间：2023/02/07
Combinatorial optimization  Locations of lines  Line-capacitated Steiner trees  Approximation algorithms  Exact algorithms  
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
收藏  |  浏览/下载：165/0  |  提交时间：2018/07/30
Mixed integer programming  Cutting plane method  Separation algorithm  Coefficient strengthening  
A class of inverse dominant problems under weighted l(infinity) norm and an improved complexity bound for Radzik's algorithm 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2006, 卷号: 34, 期号: 4, 页码: 551-567
作者:  Wang, Q;  Yang, XG;  Zhang, JZ
收藏  |  浏览/下载：89/0  |  提交时间：2018/07/30
dominant set  improvement problem  inverse problem  linear fractional combinatorial optimization  polynomial time algorithm  
Improved approximation algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 卷号: 27, 期号: 4, 页码: 399-410
作者:  Xu, DC;  Han, JY;  Huang, ZH;  Zhang, LP
收藏  |  浏览/下载：109/0  |  提交时间：2018/07/30
MAX n/2-DIRECTED-BISECTION  MAX n/2-DENSE-SUBGRAPH  polynomial-time approximation algorithm  semidefinite programming