中文版 | English

在结果中检索

CSpace

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

已选(0)清除 条数/页：   排序方式：
Approximation for the minimum cost doubly resolving set problem 期刊论文
THEORETICAL COMPUTER SCIENCE, 2016, 卷号: 609, 页码: 526-543
作者:  Chen, Xujin;  Hu, Xiaodong;  Wang, Changjun
收藏  |  浏览/下载：164/0  |  提交时间：2018/07/30
Source location  Doubly resolving set  Approximation algorithms  Polynomial-time solvability  Metric dimension  
Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 1, 页码: 1-26
作者:  AlvarezMiranda Eduardo;  CandiaVejar Alfredo;  Chen Xujin;  Hu Xiaodong;  Li Bi
收藏  |  浏览/下载：143/0  |  提交时间：2021/01/14
SERIES-PARALLEL GRAPHS  SHORTEST-PATH PROBLEM  COMPUTATIONAL-COMPLEXITY  NETWORK  OPTIMIZATION  CONSTRAINTS  ALGORITHMS  FLOWS  uncertainty modeling  prize collecting Steiner tree  interval data  series-parallel graphs  polynomial-time solvability  
Deterministic risk control for cost-effective network connections 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 3, 页码: 257-264
作者:  Alvarez-Miranda, Eduardo;  Chen, Xujin;  Hu, Jie;  Hu, Xiaodong;  Candia-Vejar, Alfredo
收藏  |  浏览/下载：181/0  |  提交时间：2018/07/30
Polynomial time algorithms  Interval data  Network design  
The partial inverse minimum spanning tree problem when weight increase is forbidden 期刊论文
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 卷号: 188, 期号: 2, 页码: 348-353
作者:  Cai, Mao-Cheng;  Duin, C. W.;  Yang, Xiaoguang;  Zhang, Jianzhong
收藏  |  浏览/下载：98/0  |  提交时间：2018/07/30
partial inverse problem  spanning tree  weight reduction  polynomial time algorithms  
Some inverse min-max network problems under weighted l(1) and l(infinity) norms with bound constraints on changes 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 卷号: 13, 期号: 2, 页码: 123-135
作者:  Yang, Xiaoguang;  Zhang, Jianzhong
收藏  |  浏览/下载：112/0  |  提交时间：2018/07/30
inverse min-max network problem  weighted l(1) norm  weighted l(infinity) norm  bound constraints  polynomial time algorithms