Research on algorithms for general network design problems

网络设计问题是一个组合优化问题，其目标是构建高效稳定的网络或对网络进行有效控制。在本研究中，我们考虑了捕获各种应用中重要任务的一般模型，并研究了它们以开发算法。特别是，我们在具有连通性和度约束的可生存网络设计问题、子模划分问题、具有集连通性需求的图定向问题和源定位问题等问题上取得了新的成果。

Network design problem is a combinatorial optimization problem the goal of which is to construct efficient and stable networks or to control networks effectively. In this research, we considered general models that capture a variety of tasks which are important in applications, and investigated them to develop algorithms. In particular, we have obtained new results for problems such as survivable network design problems with connectivity and degree constraints, submodular partition problem, graph orientation problem with set-connectivity demands, and source location problem.