升级生成树问题的拉格朗日与分支切割方法

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems

Computers and Operations Research · 2017
被引 11
ABS 3
运筹学整数规划网络优化组合优化
阅读原文 ↗