搜索资源列表
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
MaxClique
- 回朔法解决最大团问题:G的最大团是指G中所含顶点数最多的团-back Schomburg France's largest corporations to solve the problem : G the largest group G is contained in a maximum number of vertices the league
zuidatuan
- 这个 是 关于 一个 回溯法 做 的 最 大 团问题
zuidatuan
- 最大团问题, 算法数据结构。算法分析-The largest group, the largest group, algorithms, data structures. Algorithm Analysis