搜索资源列表
0-1
- 0-1背包问题， 给定一个载重量为m，n个物品，其重量为wi，价值为vi，1<=i<=n，要求:把物品装入背包，并使包内物品价值最大-0-1 knapsack problem, given a load for the m, n one item, the weight wi, the value of vi, 1 < = i < = n, asked: the items into backpacks, and to bag the maximum value of the
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of
0-1-knapsack-problem-solution
- 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
0-1
- 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
0-1-bag-problem
- 一种算法来解决0-1背包问题，这是非常好的-one arithmetic to solve 0-1 bag problem
0-1
- 0-1背包问题算法书籍代码，同大家分享！-0-1 Knapsack Problem Books in code share with you!
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
- 用于解决0/1 背包问题动态规划详解及C代码，清晰明确，简单易学-Planning the Xiangjie and C code used to solve the 0/1 knapsack problem dynamic, clear, and easy to learn
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 backtracking
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
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
0-1
- 用动态规划思路去解答经典的0-1背包问题，已成功通过调试-Using dynamic programming ideas to answer the classic 0-1 knapsack problem, has successfully passed the debugging
0-1-bugs-question
- 0-1背包的几种算法的C++实现，包括分支限界、回溯法、贪心算法几种算法-Several 0-1 knapsack algorithm c++ implementation, including branch limit, backtracking algorithm and greedy algorithm
the-problems-of-0-1-package
- 0-1背包问题在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高-the problems of 0-1 package
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法，适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
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
DP-0-1
- 0-1背包动态规划,用动态规划来求解0-1背包的问题，Java程序来实现-0-1 backpack dynamic programming, dynamic programming to solve the 0-1 knapsack problem, Java program to achieve
Backtracking-0-1
- 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-1-package-question
- 0——1背包问题的解决，注重动态规划的使用，简单快捷，方便解决0-1规划问题的解决-the question of 0-1 package problem