搜索资源列表
S201207109_assign02
- 利用动态规划算法实现0-1背包问题,要求测试数据以文本文件的形式存储,即所有的数据由文本文件读入。-Implementation of 0-1 knapsack problem using dynamic programming algorithm, test data are stored as text files, that all of the data from text file to read.
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
- 给定一个容量为C的背包及n个重量为 wi,价值为pi的物品,要求把物品装入背 包,使背包的价值最大,此类问题为背 包问题。物品或者装入背包,或者不装 入背包,称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
beibao
- 0-1背包问题,实现对一组货物价值最大化的筛选,应用排序和贪心算法实现。-0-1beibao problem
ZeroOnePack
- 分支界限法求解0-1背包问题。有N件物品和一个容量为V的背包,第i件物品的费用是c[i],价值是w[i],求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。-Branch and bound method for solving 0-1 knapsack problem. N items and a capacity V of the backpack, the cost of items i C [i], the value of W [i], the sum of
knapsack
- 本源程序主要是实现算法中的0-1背包问题,此程序在Visual C++6.0下实现-implement the knapsack problem
0_1
- 实现0-1背包问题的实现,算法分析与设计-0-1 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.
01backpack
- 算法设计与分析01背包优化问题实验 0-1背包问题: : 有N个物品和一个背包,其中: 物品具有重量 (w1, w2, …, wn) 和价值 (v1, v2, …, vn) 背包的最大重量承受限制为c 如何放置物品可得最高价值? 思路:动态规划 -Algorithm Design and Analysis 01 knapsack optimization experiments 0-1 knapsack problem :: with N items and a back
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
aco-01knapsackainfo
- 蚁群算法解决0-1背包问题源码及资料,蚁群优化英文版-Ant colony algorithm to solve 0-1 knapsack problem and information source, ant colony optimization English
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
beibaofenti
- 大学数据结构上机作业,C++语言写的0-1背包问题解析,练习并理解0-1背包的原理。-University of machine operation data structures, C++ language to write the 0-1 knapsack problem analysis, practice and understand the principles of the 0-1 knapsack.
bag
- 非常经典的0-1背包问题采用贪心算法实现-Very classical 0-1 knapsack problem using greedy algorithm
beibao
- 一个很好的运用模拟退火解决0-1背包问题的一个例子程序-A good use of simulated annealing to solve 0-1 knapsack problem an example program
GA_knapsack
- 使用遗传算法解决0-1背包问题,算法效率好-The use of genetic algorithm to solve 0-1 knapsack problem, a good algorithm efficiency
0-1-dynamic-program
- 01背包问题示例,有助于理解动态规划的思路和一般解决方法-to learn how to solve dynamic program