CSpace

浏览/检索结果: 共2条,第1-2条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Shortest path and maximum flow problems in networks with additive losses and gains 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 4-5, 页码: 391-401
作者:  Brandenburg, Franz J.;  Cai, Mao-cheng
收藏  |  浏览/下载:115/0  |  提交时间: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
作者:  Cai, Mao-cheng;  Deng, Xiaotie;  Li, Zhongfei
收藏  |  浏览/下载:113/0  |  提交时间:2018/07/30
frictional market  weak no-arbitrage  computational complexity  NP-hard