搜索资源列表
geosteiner-3.1.tar
- A classic Steiner tree constructor based on branch-and-bound with the most close-to-optimum solution quality
bag
- 分支限界法解决0/1背包问题，用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
submission.tar
- Branch and bound is one of the best complete. algorithms for the tsp decision problem
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
7
- 分支界限法的课件，很详细，很强大，很好的学习资料，献给大家了！-Branch and bound courseware, very detailed, very powerful, very good learning materials, dedicated to all of you!
minPath
- 这是一道算法作业题目，解决一个分支定界问题，求最短路径问题-This is an algorithm assignment questions to resolve a branch and bound for the shortest path problem