文章基本信息

标题：A partitioning algorithm for the network loading problem
本地全文：下载
作者：Frédéric BABONNEAU ; Jean-Philippe VIAL
期刊名称：CORE Discussion Papers / Center for Operations Research and Econometrics (UCL), Louvain
出版年度：2007
卷号：1
出版社：Center for Operations Research and Econometrics (UCL), Louvain
摘要：This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The effort of computing integer solutions is entirely left to a pure integer programming solver while valid inequalities are generated by solving standard nonlinear multicommodity flow problems. The method is compared to alternative approaches proposed in the literature and appears to be efficient.
关键词：network loading problem, Benders partitioning, ACCPM.