搜索资源列表
-
0下载：
该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
-
-
0下载：
0-1背包问题的贪心算法
希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
-
-
0下载：
0-1背包问题，
0-1背包问题 Version 1.0
2008-10-28-0-1 knapsack problem, 0-1 knapsack problem Version 1.02008-10-28
-
-
2下载：
本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
-
-
0下载：
this file solve 0/1 knapsack problem
-
-
0下载：
0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
-
-
0下载：
c语言实现的0-1背包问题，很简单，运行正常可靠，页面简洁。-c language implementation of the 0-1 knapsack problem, is very simple, operating normally reliable, simple page.
-
-
0下载：
实现0—1背包问题的分支限界搜索，为控制台应用程序，编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
-
-
0下载：
这个文件夹包含了0-1背包问题的源代码、可执行文件和上级报告。-This folder contains the 0-1 knapsack problem source code, executable files, and supervisor.
-
-
0下载：
0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
-
-
0下载：
0-1背包问题是算法设计中很经典的一个问题。如何让价值最大化是这个问题所要考虑的问题。-0-1 knapsack problem is a classic algorithm design a problem. How to maximize the value of this issue to consider.
-
-
0下载：
這是一個使用greedy所寫的0-1 Knapsack Problem
，所有的物品若要取則必須全取，此程式可以讓背包裝最多且最有價值的物品-This is a greedy written using the 0-1 Knapsack Problem, to take all the items must all take, the program can back up and packing the most valuable items
-
-
0下载：
我自己用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 backtracking
-
-
0下载：
动态规划解决01背包问题,采用c语言实现-01 dynamic programming to solve the knapsack problem, with c language
-
-
0下载：
0-1背包问题的回溯法求解,0-1背包是在M件物品取出若干件放在空间为W的背包里，求出获得最大价值的方案。算法设计 回溯的思想。-Backtracking 0-1 knapsack problem solving 0-1 knapsack is removed in several pieces on items M space W backpack, determined to get the maximum value of the program. Backtracking algorit
-
-
0下载：
0-1背包问题的实现，用HTML，js编写的算法(0-1 knapsack problem implementation, using HTML, JS algorithm written)
-
-
0下载：
用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
-
-
0下载：
0/1背包问题动态规划详解及C代码
动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code
Dynamic programming is the abstraction of a method of replacing time with space.)
-
-
0下载：
利用动态规划实现0-1背包问题，文件包含源代码，解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
-
-
3下载：
使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
-
