Browse/Search Results:  1-7 of 7 Help

Selected(0)Clear Items/Page:    Sort:
Shortest path and maximum flow problems in networks with additive losses and gains 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 4-5, 页码: 391-401
Authors:  Brandenburg, Franz J.;  Cai, Mao-cheng
Favorite  |  View/Download:3/0  |  Submit date:2018/07/30
Extended networks  Lossy and gainy arcs  Max-flow problems  Shortest path problems  NP-hard problems  Unit-loss networks  
Computation of arbitrage in frictional bond markets 期刊论文
THEORETICAL COMPUTER SCIENCE, 2006, 卷号: 363, 期号: 3, 页码: 248-256
Authors:  Cai, Mao-cheng;  Deng, Xiaotie;  Li, Zhongfei
Favorite  |  View/Download:3/0  |  Submit date:2018/07/30
frictional market  weak no-arbitrage  computational complexity  NP-hard  
Minimum Conflict Individual Haplotyping from SNP Fragments and Related Genotype 期刊论文
EVOLUTIONARY BIOINFORMATICS, 2006, 卷号: 2, 页码: 261-270
Authors:  Zhang, Xiang-Sun;  Wang, Rui-Sheng;  Wu, Ling-Yun;  Zhang, Wei
Favorite  |  View/Download:3/0  |  Submit date:2018/07/30
individual haplotyping  minimum conflict individual haplotyping  NP-hard  dynamic programming  feed-forward neural network  reconstruction rate  
Total balancedness condition for Steiner tree games 期刊论文
DISCRETE APPLIED MATHEMATICS, 2003, 卷号: 127, 期号: 3, 页码: 555-563
Authors:  Fang, QZ;  Cai, MC;  Deng, XT
Favorite  |  View/Download:5/0  |  Submit date:2018/07/30
cooperative game  Steiner tree  core  total balancedness  NP-hard  
Complexity of partial inverse assignment problem and partial inverse cut problem 期刊论文
Authors:  Yang, XG
Favorite  |  View/Download:6/0  |  Submit date:2018/07/30
partial inverse assignment problem  partial inverse minimum cut problem  NP-hard  
Reverse center location problem 期刊论文
ALGORITHMS AND COMPUTATIONS, 2000, 卷号: 1741, 页码: 279-294
Authors:  Zhang, JZ;  Yang, XG;  Cai, MC
Favorite  |  View/Download:3/0  |  Submit date:2018/07/30
networks and graphs  NP-hard  satisfiability problem  relaxation  maximum cost circulation  
Some network enlargement problems 期刊论文
CHINESE SCIENCE BULLETIN, 1996, 卷号: 41, 期号: 20, 页码: 1676-1678
Authors:  Yang, XG
Favorite  |  View/Download:4/0  |  Submit date:2018/07/30
network enlargement  minimum cost flow  NP-hard  combinatorial strongly polynomial algorithm