Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing.

Eur. J. Oper. Res.(2023)

引用 1|浏览0
暂无评分
摘要
•Three Benders-type algorithms in which the subproblem is a mixed integer program.•Results on instances for capacitated facility location with single-sourcing.•Significant speedup compared to CPLEX with up to 25% single-sourcing.•Extensive guidance on the implementation of the proposed algorithms.•Presentation of the topic also suitable for the inexperienced reader.
更多
查看译文
关键词
Integer programming, Benders' algorithm, Branch-and-cut, Mixed integer subproblems, Facilities planning and design
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要