摘要
文章提出了用回溯算法求解多枢纽选址问题的思路和程序 ,并对程序的空间复杂度和时间复杂度进行了分析 ,通过对枢纽数较少的情况下程序的计算能力进行的分析 。
This paper introduces a method and its program by using backtracking algorithm to solve location of multiple hubs. This paper also analyzes the space complexity and time complexity of the method. Furthermore, by analyzing the capability of the program in case of few hinges, the authors conclude that this method is highly feasible in application.
出处
《交通与计算机》
2004年第6期76-78,共3页
Computer and Communications