中文版 | English

在结果中检索

CSpace

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

限定条件                    
已选(0)清除 条数/页：   排序方式：
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
收藏  |  浏览/下载：102/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  
A method of estimating computational complexity based on input conditions for N-vehicle problem 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2010, 卷号: 26, 期号: 1, 页码: 1-12
作者:  Xia, Xi;  Cui, Jin-chuan
收藏  |  浏览/下载：129/0  |  提交时间：2018/07/30
Complexity of computation  combinatorial optimization  N-vehicle problem  permutations  inverse order  
Exploring the constrained maximum edge-weight connected graph problem 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2009, 卷号: 25, 期号: 4, 页码: 697-708
作者:  Li, Zhen-ping;  Zhang, Shi-hua;  Zhang, Xiang-Sun;  Chen, Luo-nan
收藏  |  浏览/下载：124/0  |  提交时间：2018/07/30
connected subgraph  integer linear programming model  network flow  constraint Steiner network  maximum edge weight, heuristic algorithm