单人最优巡回路问题算法研究

Algorithmic Analysis of the Single Circuit Problem

基于生活实例,引出问题讨论,建立了理论模型及实用简化模型,在BORLANDC环境中编程实现了最小生成树算法和递归穷举法.最后,分析了理论模型的缺陷,并运用递归穷举法对结果进行检验.

This paper which raises the single circuit problem from a lively instance, builds both the theoretical model and the simplified applying model, and carries the solutions out in Borland C system. Moreover, it discusses the limitation of the theoretical model, and the result of the instance is tested by recursive exhaustion technique.