度约束最小生成树问题概述

Overview of Degree Constrained Minimum Spanning Tree Problem

度约束最小生成树问题是经典的组合优化难题。本文对度约束最小生成树问题进行了综述,介绍了研究背景、数学模型及相关概念,并对该问题的求解算法进行了分类总结。

Degree constrained minimum spanning tree problem is a classic combinatorial optimization problem. this paper reviewed the degree constrained minimum spanning tree problem, introduced the research background mathematical models and concepts, and summarized this problem solving algorithm.