CSpace

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

已选(0)清除 条数/页:   排序方式:
Inverse problems of submodular functions on digraphs 期刊论文
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 卷号: 104, 期号: 3, 页码: 559-575
作者:  Cai, M;  Yang, X;  Li, Y
收藏  |  浏览/下载:83/0  |  提交时间:2018/07/30
inverse problems  submodular functions  digraphs  minimum cost circulation  strongly polynomial algorithms  
Inverse problems of matroid intersection 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 1999, 卷号: 3, 期号: 4, 页码: 465-474
作者:  Cai, MC
收藏  |  浏览/下载:93/0  |  提交时间:2018/07/30
Inverse problem  matroid intersection  minimum cost circulation  strongly polynomial algorithm  
Inverse polymatroidal flow problem 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 1999, 卷号: 3, 期号: 1, 页码: 115-126
作者:  Cai, MC;  Yang, XG;  Li, YJ
收藏  |  浏览/下载:97/0  |  提交时间:2018/07/30
inverse problem  polymatroidal flow  minimum cost circulation  combinatorial strongly polynomial algorithm  
Inverse problem of minimum cuts 期刊论文
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 卷号: 47, 期号: 1, 页码: 51-58
作者:  Zhang, JZ;  Cai, MC
收藏  |  浏览/下载:75/0  |  提交时间:2018/07/30
inverse problem  maximum flow  minimum cut  minimum cost circulation  strongly polynomial algorithm  
Inverse matroid intersection problem 期刊论文
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1997, 卷号: 45, 期号: 2, 页码: 235-243
作者:  Cai, MC;  Li, YJ
收藏  |  浏览/下载:79/0  |  提交时间:2018/07/30
inverse matroid intersection problem  minimum cost circulation  strongly polynomial algorithm