搜索资源列表
TSP
- 这是用Delphi编写的程序，目的是用TSP（分支限界法）实现旅行商问题-This is a program written with Delphi, the purpose is to use TSP (branch and bound method) to achieve the traveling salesman problem
TSP
- TSP分支限界法求最短路径，可读取代价矩阵的txt。-Use TSP branch and bound Method to find the shortest path. Cost matrix can be read from txt.
Branch-threshold-method
- 运用分支限界法解布线问题。Branch threshold method wiring-Branch threshold method wiring
Wiring
- 利用分支限界法解决布线问题，按照优先队列中规定的优先级选取优先级最高的节点成为当前扩展节点-Wiring problem