搜索资源列表
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
DAIMA
- 大学生毕业论文模拟退火算法解决背包问题的jsp源代码文件-JSP source code files of graduation thesis simulated annealing algorithm to solve knapsack problem
0-1packet
- 实现0—1背包问题，使用动态规划，有注释。-0-1 knapsack problem, the use of dynamic programming, there are notes.
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
Knapsack2
- 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
BB
- 对背包问题进行研究 用MATLAB来实现-Knapsack problem using MATLAB to realize
Score-backpack
- 分数背包的实现，在基础背包的前提下，增加分数属性，实现背包问题-The realization of the score backpack to increase the score property, under the premise of basic backpack, knapsack problem
01package
- 集群应用，在mpi环境中采用C++解决01背包问题-the application of c++ in clusters on mpi
40964005
- 多重背包问题求解算例，很实用很酷。不需任何改动-Multiple knapsack problem
01bag
- 0/1背包问题，分置限界优先队列解决，C++实现。-0/1 knapsack problem, split and bound priority queue solve, C++ implementation.
pack_Brute_force
- 用回溯法解决背包问题 用回溯法解决背包问题-Use backtracking to solve knapsack problem using backtracking to solve knapsack problem
beibao_ga
- 用遗传算法求解背包问题，用启发式算法求解背包问题。-Knapsack problem using genetic algorithm, heuristic algorithm for solving knapsack problem.
Demo1
- 算法O-1背包问题，使用Myeclipse编写，java代码，得出最优解。-The 0-1 Knapsack
bagsolution
- C#实现的01背包问题，里面使用了接口，适合初学者使用-C# implementation of the 01 knapsack problem, which uses the interface, suitable for beginners to use
advanced--algrithms
- 高级算法的代码， 背包问题 覆盖问题 旅行商问题等-Advanced algorithm code, knapsack problem cover problem traveling salesman problem, etc.
01backpack
- 算法设计与分析01背包优化问题实验 0-1背包问题： : 有N个物品和一个背包，其中: 物品具有重量 (w1, w2, …, wn) 和价值 (v1, v2, …, vn) 背包的最大重量承受限制为c 如何放置物品可得最高价值? 思路：动态规划 -Algorithm Design and Analysis 01 knapsack optimization experiments 0-1 knapsack problem :: with N items and a back
bagsolutions
- 多种不同背包问题的解释和解答思路，适合初学者理解实现-Many different explanations and answers knapsack problem ideas for beginners to understand
beibao
- 一个 数据结构 关于背包问题的求解 c语言源代码-A knapsack problem solving on c language source code
shujujiegou
- 一个 课程设计 内容有 航班订票系统 各种排序程序的实现 还有一个关于背包问题的实现 c源代码-A curriculum design content flight booking system to achieve a variety of sorting procedures there is a realization on the knapsack problem c source code
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data