摘要
本文从集合划分的概念出发,提出了关于树的q-最优划分的问题。同时,还提出了求树的q-最优划分的精确算法和启发式算法。最后,以配电网系统的实际设计为例来说明算法的应用。
This paper presents a concept of q-optimal partition of a tree by using the concept of set partition.An exact algorithm and a heuristic algorithm for finding the q-optimal partition of a tree are developed respectively.A practical example of planning an electrical distribution network is given.
关键词
图论
组合规划
应用
Graph-theoretical algorithms
Combinatorial Programming
Application
