.png){kind=icon}
返回
Solving difficult multicommodity problems with a specialized interior-point algorithm
.png){kind=icon}
PRE
AI
DOI：10.1023/B:ANOR.0000004761.99649.a5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to recent advances in the development of linear programming solvers, some of the formerly considered difficult multicommodity problems can today be solved in few minutes, even faster than with specialized methods. However, for other kind of multicommodity instances, general linear solvers can still be quite inefficient. In this paper we will give an overview of the current state-of-the-art in solving large-scale multicommodity problems, comparing an specialized interior-point algorithm with CPLEX 6.5 in the solution of difficult multicommodity problems of up to 1 million of variables and 300,000 constraints.
Keyword:
interior-point methods
linear programming
multicommodity flows
network optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
