中文版 | English

在结果中检索

CSpace

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

已选(0)清除 条数/页：   排序方式：
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions 期刊论文
APPLIED NUMERICAL MATHEMATICS, 2007, 卷号: 57, 期号: 9, 页码: 1033-1049
作者:  Zhao, Y. B.
收藏  |  浏览/下载：105/0  |  提交时间：2018/07/30
linear programming  interior-point algorithms  iteration complexity  neighborhoods  
A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function 期刊论文
SIAM JOURNAL ON OPTIMIZATION, 2005, 卷号: 15, 期号: 4, 页码: 1105-1127
作者:  Peng, JM;  Terlaky, T;  Zhao, YB
收藏  |  浏览/下载：151/0  |  提交时间：2018/07/30
linear optimization  interior-point methods  predictor-corrector self-regular proximity function  large neighborhoods  polynomial complexity  superlinear convergence  
Upper bounds for the k-subdomination number of graphs 期刊论文
DISCRETE MATHEMATICS, 2002, 卷号: 247, 期号: 1-3, 页码: 229-234
作者:  Kang, LY;  Dang, CY;  Cai, MC;  Shan, EF
收藏  |  浏览/下载：70/0  |  提交时间：2018/07/30
graph  tree  open and closed neighborhoods  k-subdomination number