搜索资源列表
货郎担问题四种解法
- 货郎担问题的回溯，枚举，分支界限，动态规划解法-back the traveling salesman problem, except, branch line, dynamic programming solution
分支界限
- 用vc编写的解决计算机算法中的分支限界问题，非常经典的代码，请多多指教！-vc prepared with the computer algorithm to solve the branch and bound, very classic code, a great weekend!
MaxClique
- 分支界限法解决最大团问题，编译通过，代码正确-Branch and bound method to solve the maximum clique problem, compiled through the correct code