A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks

European Journal of Operational Research（2021）

引用 10|浏览5

暂无评分

摘要

•Interior-point method for minimum convex cost flow problems in bipartite networks.•For linear and convex instances with diagonal Hessians.•It solved instances of up to one billion arcs and 5 million nodes.•It outperformed best state-of-the-art solvers in several classes of instances.

查看译文

关键词

Large-scale optimization,Interior-point methods,Minimum cost flow problems,Preconditioned conjugate gradient

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要