.png){kind=icon}
返回
A least-squares minimum-cost network flow algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-0858-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Node-arc incidence matrices in network flow problems exhibit several special least-squares properties. We show how these properties can be leveraged in a least-squares primal-dual algorithm for solving minimum-cost network flow problems quickly. Computational results show that the performance of an upper-bounded version of the least-squares minimum-cost network flow algorithm with a special dual update operation is comparable to CPLEX Network and Dual Optimizers for solving a wide range of minimum-cost network flow problems.
Keyword:
Network flow
Least-squares
Primal-dual
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Role of Interleukin 28B Polymorphisms in Response to Interferon Based Therapy for Hepatitis C Virus Clearance白细胞介素28B多态性在干扰素为基础的治疗清除丙型肝炎病毒中的作用
PREAI
分享收藏
查看更多内容