搜索资源列表
simulateanneal
- 一个解决0-1背包问题的模拟退火程序，希望给有需要的人帮助-A solution to the 0-1 knapsack problem simulated annealing process, hoping to help those in need
0-1beibao
- 这是用贪心算法解决0-1背包问题的一个算法源码-something about 0-1 knapsack problems
0-1_bag_problem
- 0-1背包问题的动态规划解法，C++源码，并附有详细的实验报告-0-1 bag problem
0-1beibao
- 0-1背包问题，很经典的一个问题，基于动态规划的经典案例。-0-1 knapsack problem, it is a problem in the classic, classic case based on dynamic programming.
1.tar
- 用C++实现的0-1背包问题的动态规划解法程序。注释详实，可读性好。-C++ implementation with the 0-1 knapsack problem dynamic programming solution procedure. Comments detailed, readable.
packegePSO1
- 用matlab编写的一个解决0-1背包问题，其算法采用粒子群算法-use matlab software write 0-1 knapsack problem use PSO method
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
0-1bag
- 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
0-1beibao
- 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
0-1-bag-problem
- 一种算法来解决0-1背包问题，这是非常好的-one arithmetic to solve 0-1 bag problem
0-1-knapsack-problem-matlab
- 关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
QEA-solving-0-1-Knapsack-problem
- 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
0-1
- 我自己用C写的一个用分支界限法实现0-1背包问题，比较简便实用，而且易懂，比回溯法有明显的优势-I have written in C, a branch and bound method 0-1 knapsack problem is relatively simple and practical, and easy to understand, there are obvious advantages than backtracki
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and b
0-1bag
- 0-1背包问题：有N件物品和一个容量为V的背包。第i件物品的花费是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。-The 0-1 knapsack problem: N items and a capacity of V backpack. Take the first I items is c[i], the value is w[i]. For which goods loaded backpack can ma
the-problems-of-0-1-package
- 0-1背包问题在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高-the problems of 0-1 package
0-1-knapsack-problem--
- 算法分析与设计（王晓东版）的0-1背包问题的改进算法的java代码实现，实现背包问题的求解-Algorithm analysis and design (Wang Xiaodong version) algorithm to improve the 0-1 knapsack problem is java code
0-1knapsack-problem
- 这是一个简单的0-1背包问题，采用matlab编程，使用模拟退火算法求解，结果精确快速，并可以应用到很多其他问题-This is a simple 0-1 knapsack problem, using matlab programming, simulated annealing algorithm, accurate results quickly, and can be applied to many other problems
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.
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