以寻找最短的加权送电路径为优化目标,将网络重构建模为一个寻找图的局部最小树问题,并计及各种约束。
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
以寻找最短的加权送电路径为优化目标,将网络重构建模为一个寻找图的局部最小树问题,并计及各种约束。
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
应用推荐