搜索资源列表
tanxinsuanfa
- 背包问题和0/1背包问题的主要区别就是物品可不可以再分割。背包问题中的物品可以再进行分割,而0/1背包问题中的物品则反之。贪心算法往往只从局部去考虑问题,所以在解决0/1背包问题时得不到最优解。-class GreedyAlgorithm{ public: GreedyAlgorithm(int _weight[],int _value[],int capacity) double*ComputeRatio() void Sor
dongtaiguihua
- 动态规划解决0-1背包问题,可以完整输出结果-Dynamic programming to solve 0-1 knapsack problem, you can complete the output
knapsack
- c语言实现的0-1背包问题,很简单,运行正常可靠,页面简洁。-c language implementation of the 0-1 knapsack problem, is very simple, operating normally reliable, simple page.
txss
- 0-1背包问题,非常重要的,必须好好学啊!同学忙呢 -0-1 knapsack problem, a very important and should be properly learn ah! Busy students do
knapsack
- 这个文件夹包含了0-1背包问题的源代码、可执行文件和上级报告。-This folder contains the 0-1 knapsack problem source code, executable files, and supervisor.
BranchandBound_01backpack
- 0-1背包问题是一个经典的算法问题,有多种解法,这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
DynamicProgramming_01backpack
- 0-1背包问题是一个经典的算法问题,有多种解法,这里用动态规划的方法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are a variety of solution, where the method for solving using dynamic programming.
0-1KnapsackProblem
- 這是一個使用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
Recursive-loop
- 是学习递归循环用法的很好的几个实例,包括经典的0-1背包问题,8皇后问题,概率问题等等,相信能帮助你更好的理解C中递归循环的实现。-Learning recursive cycle usage of several instances, including the classical 0-1 knapsack problem, the eight queens problem, probability problems, I believe it can help you understand
0_1beibao
- 分别用回溯法和动态规划解决0-1背包问题,输出装入背包的顺序-Backtracking and dynamic programming to solve the 0-1 knapsack problem, the order in which the output is loaded backpack
daima
- 动态规划,贪心算法和回溯解决0-1背包问题-Dynamic programming, greedy algorithms and backtracking to solve 0-1 knapsack problem
knapsack
- 利用遗传算法解决0-1背包问题的c++程序代码-Genetic algorithm to solve the knapsack problem c++ program
fenzhixianjie
- 分支限界法实现0-1背包问题源代码测试通过-Source code testing by branch and bound 0-1 knapsack problem
box
- 基于动态规划法的0-1背包问题,本代码实现了背包问题的详细过程。-0-1 knapsack problem based on dynamic programming, the code to achieve the detailed process of the knapsack problem.
beibao
- 0-1背包问题,实现对一组货物价值最大化的筛选,应用排序和贪心算法实现。-0-1beibao problem
knapsack
- 本源程序主要是实现算法中的0-1背包问题,此程序在Visual C++6.0下实现-implement the knapsack problem
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
01bag
- 0/1背包问题,分置限界优先队列解决,C++实现。-0/1 knapsack problem, split and bound priority queue solve, C++ implementation.
6d5
- 王晓东《算法设计与分析》第六章第五节0-1背包问题分支限界法求解-Xiaodong " algorithm design and analysis," Chapter V 0-1 knapsack problem branch and bound method to solve
suanfa
- 计算机算法设计与分析 0-1背包问题 士兵站队问题 最长子序列 工作分配 会场安排 -Design and Analysis of Computer Algorithms 0-1 knapsack problem question soldiers stand longest sequence assignment venue arrangements