搜索资源列表
TSP
- 遗传算法在旅行商问题下的一种应用代码，一种能够解决多维背包问题的应用代码。-Genetic algorithm in the traveling salesman problem of a kind of application code, one can solve the multi-dimensional knapsack problem application code.
liziqun
- 粒子群算法的基础源代码，可有效解决背包问题。-Particle swarm algorithm based on the source code, which can effectively solve the knapsack problem.
0-1backbag
- 北邮算法设计与分析第三章上机作业 关于0-1背包问题的具体算法-BUPT algorithm design and analysis of the third chapter on machine operation on specific algorithms 0-1 Knapsack Problem
pso-beibao
- 粒子群算法解决背包问题，程序完整并能正确运行-Particle swarm algorithm to solve knapsack problem
src
- ACM题目用优先队列法解决0-1背包问题c++源代码-ACM topic with priority queuing method to solve 0-1 knapsack problem c++ source code
P6-1
- 这是一个模拟退火程序，可以用于解决背包问题-This is a simulated annealing procedures can be used to solve the knapsack problem
0-1_package_problem
- 0-1背包问题：使用动态规划算法进行求解0-1背包问题-0-1 Knapsack Problem: Solve the 0-1 knapsack problem using a dynamic programming algorithm
liangziyichuan
- 量子遗传算法解决0-1背包问题的MATLAB代码，亲测好用-Quantum genetic algorithm to solve 0-1 knapsack problem MATLAB code, useful pro-test
0-1beibao
- 这是用MFC写的，开发环境是VC++。有软件界面，主要用于求解0-1背包问题，亲测无误。-This is written in MFC, and the development environment is VC++. It has software interface, mainly for solving 0-1 knapsack problem.
PSO
- 基于粒子群算法的多目标搜索算法，本案例采用多目标粒子群算法求解多目标背包问题。-Multiple target search algorithm based on particle swarm optimization (pso) algorithm, this case USES the multi-objective particle swarm optimization (pso) algorithm to solve multi-objective knapsack problem.
bei-bao-wen-ti
- 基于粒子群算法的多目标搜索算法。运用粒子群算法求解背包问题。-Using Particle Swarm Optimization to Solve Knapsack Problem
simulated annealing algorithm
- 模拟退火算法的应用很广泛，可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等。(Simulated annealing algorithm is widely used, can be more efficient to solve the maximum Problem Cut (Max), 0-1
0-1背包问题
- 0-1背包问题的实现，用HTML，js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
c++实现0-1背包问题
- 用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
ILOG 背包问题7物品12资源
- ILOG CPLEX 编写 背包 问题 求解(THIS is write by IBM ILOG CPLEX,the OPL language for Knapsack problem,include 12 products)
粒子群01背包
- 用粒子群算法解决01背包问题（100个物品）从而得到最优解(The particle swarm algorithm is used to solve the 01 knapsack problem (100 items), and thus the optimal solution is obtained)
OwnTest
- 通过Java编码实现标准遗传算法（SGA）解决背包问题(Through Java coding, the standard genetic algorithm (SGA) is implemented to solve knapsack problem)
动态规划
- 背包问题的动态规划程序，只是简单实现，有什么问题可以和我交流讨论。(Knapsack problem dynamic planning process, just a simple realization, what issues can be discussed with me.)
背包问题
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题(Knapsack problem (Knapsack problem) is a NP complete problem of combinatorial optimization)
c1
- 动态规划解决背包问题 列出所有可能情况并进行求值 适用于较小数据测试(Dynamic programming to solve knapsack problem)