Search - knapsack

Search - knapsack - List

【JSP/Java】 Knapsack DL : 0: 0-1背包问题此算法包含了输入界面，可以随意设置货物的数量和价值。-0-1 knapsack problem algorithm includes the input interface, the number and value of the goods can be arbitrarily set.
Update : 2024-05-18 Size : 1024 Publisher : 郑浩
【Other】 Knapsack-problem DL : 0: 数据结构的经典背包问题，C++实现版本，欢迎批评指正~-Knapsack problem for c++
Update : 2024-05-18 Size : 1222656 Publisher : aby
【Successful incentive】 Knapsack DL : 0: The describe of Knapsack algorithm
Update : 2024-05-18 Size : 1414144 Publisher : Zahra
【Other】 knapsack DL : 0: 利用遗传算法解决0-1背包问题的c++程序代码-Genetic algorithm to solve the knapsack problem c++ program
Update : 2024-05-18 Size : 10240 Publisher : sukey
【Other】 Knapsack DL : 0: 设计一般背包问题的贪心算法，对于任意给定的一般背包问题，都能够得到最优解-Greedy algorithm design in general knapsack problem, for any given general knapsack problem, are able to obtain the optimal solution
Update : 2024-05-18 Size : 1024 Publisher : 祝婷
【Other】 knapsack DL : 0: 本源程序主要是实现算法中的0-1背包问题，此程序在Visual C++6.0下实现-implement the knapsack problem
Update : 2024-05-18 Size : 1114112 Publisher : xiaochun
【JSP/Java】 Knapsack DL : 0: 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorithms and data structures
Update : 2024-05-18 Size : 2048 Publisher : xuchao
【Data structs】 ts-solve-0-1-knapsack-a-info DL : 0: 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
Update : 2024-05-18 Size : 5421056 Publisher : cmn
【AI-NN-PR】 GA-to-solve-knapsack-problem DL : 0: Genetic algorithm to solve knapsack problem
Update : 2024-05-18 Size : 3072 Publisher : 康超
【Other】 knapsack DL : 0: my code implemention for knapsack algorithm
Update : 2024-05-18 Size : 513024 Publisher : mohandesi
【Windows Develop】 knapsack DL : 0: VB背包问题遗传算法求解的源码实例,有兴趣的可以下载。-VB knapsack problem genetic algorithm source code examples, are interested in can be downloaded.
Update : 2024-05-18 Size : 4096 Publisher : 什锦豆腐
【Data structs】 01-knapsack-algorithm DL : 0: 01背包动态规划算法,实现01背包算法的一个简单例子-01 knapsack dynamic programming algorithm to achieve 01 knapsack algorithm is a simple example
Update : 2024-05-18 Size : 258048 Publisher : 骆芷茵
【Algorithm】 knapsack DL : 0: A branch and bound algorithm for the 0-1 knapsack problem.
Update : 2024-05-18 Size : 3072 Publisher : michael
【Data structs】 0-1-Knapsack-problem DL : 0: 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorithm to solve the problem, so as to further the understanding of the principles of various algorithms, ideas and nature, deepening of the algorithm Learn to exercise their own analysis of the various algorithms and use familiar with the software underlying algorithms and programming interface.
Update : 2024-05-18 Size : 202752 Publisher : invest
【Other】 Knapsack DL : 0: Knapsack with recursive and backtracking
Update : 2024-05-18 Size : 1024 Publisher : Petrus Gumarang
【Other】 Deformation-knapsack-problem DL : 0: 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues
Update : 2024-05-18 Size : 49152 Publisher : 宋
【VC/MFC】 Code-four-methods-knapsack-problem DL : 0: 背包问题的四种实现代码动态规划贪婪算法回溯法分支限界法-Four knapsack problem dynamic programming code backtracking greedy algorithm branch and bound method
Update : 2024-05-18 Size : 94208 Publisher : mulanjingqian
【Console】 Knapsack DL : 0: 算法设计与分析中背包问题。首先将最优解矩阵的第一行和第一列均赋值为0；然后从上至下、从左至右依次计算m[i][j]的值，如果第i个物品的重量大于j的值，即第i个物品不放入背包中，则将m[i][j]赋值为m[i-1][j]，否则取第i个物品放入背包和不放入背包所得价值的最大值；最后从后往前计算最优解向量的值，如果m[i][j]=m[i-1][j]，则将x[i]赋值为0，否则将x[i] 赋值为1，并将j减去第i个物品的重量。-The knapsack problem algorithm design and analysis. First, the optimal solution in the first row and first column of the matrix are assigned 0 then from top to bottom, computing m [i] [j] values from left to right, if the weight is greater than the i-th item j values, i.e., the i-th item is not put into the backpack, then m [i] [j] assigned to m [i-1] [j], otherwise, it is the i-th item is not put into the resultant bags and backpacks the maximum value finally calculate the optimal solution from the previous value of the vector, if m [i] [j] = m [i-1] [j], then the x [i] values 0, otherwise x [i] value of 1, the i-th and j minus the weight of the article.
Update : 2024-05-18 Size : 2048 Publisher :
【Game Program】 knapsack DL : 0: algorithm Knapsack Problem genetic algorithms
Update : 2024-05-18 Size : 5120 Publisher : Ekaterina
【Documents】 knapsack-problem- DL : 0: 基于二重结构编码遗传算法求解背包问题的研究-Research knapsack problem based on dual-structure code genetic algorithm
Update : 2024-05-18 Size : 354304 Publisher : 金明

« 1 2 ... 7 8 9 10 11 1213 14 15 16 17 ... 50 »