Search - knapsack

Search - knapsack - List

【Algorithm】 0_1question DL : 0: 计算机算法中著名的0_1背包问题：给定n种物品和一背包。物品i的重量是Wi，其价值为Vi，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and backpack is the capacity c, asked how to choose a backpack loaded the items, make backpack loaded with a total value of the largest.
Update : 2024-05-04 Size : 11264 Publisher : 贾明明
【Data structs】 01package DL : 0: 背包问题优先队列分枝限界算法所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method.
Update : 2024-05-04 Size : 238592 Publisher : 王涛
【AI-NN-PR】 GA_for_TSP DL : 0: 用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W·2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.
Update : 2024-05-04 Size : 25600 Publisher : 王杰
【Algorithm】 0-1beibao DL : 0: 解决背包的取舍问题，问选择多少个不超过背包的重量的物品．能使价值最大．-solve knapsack choice question about the choice of the number does not exceed the weight of the backpack items. Make the greatest value.
Update : 2024-05-04 Size : 1024 Publisher : solid
【JSP/Java】 beibaobeibao DL : 0: 这是一个0/1背包问题的解决，有图形界面，是一次软件实习作业 -This is a 0/1 knapsack problem solving, graphics interface, the software is a practical operation
Update : 2024-05-04 Size : 5120 Publisher : sky
【Algorithm】 beibao__1wei DL : 0: 背包问题得模拟退火解法实现，调试通过，觉得有收藏价值。-knapsack problem in the simulated annealing method to achieve, through debugging feel the collectible value.
Update : 2024-05-04 Size : 1024 Publisher : 李物
【AI-NN-PR】 0-1package DL : 0: 遗传算法求解0-1背包问题，包含问题的求解步骤。-Genetic Algorithm 0-1 knapsack problem, including steps to solve the problem.
Update : 2024-05-04 Size : 6144 Publisher : 何海斌
【Other】 01BEIBAOdongtai DL : 0: 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
Update : 2024-05-04 Size : 1024 Publisher : xieyixin
【Data structs】 GenerationAl DL : 0: 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0/1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here.
Update : 2024-05-04 Size : 2048 Publisher : 李博宁
【Button control】 Chp15 DL : 0: 背包问题的遗传算法解法背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
Update : 2024-05-04 Size : 1018880 Publisher :
【Algorithm】 OI DL : 0: 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
Update : 2024-05-04 Size : 431104 Publisher : 王垂宇
【Compress-Decompress algrithms】 huishu01beibao DL : 0: 回朔解决0-1背包,里面有VC++的代码,可供大家参考,如里有误的,请和我联系-retrospective resolve 0-1 knapsack containing a VC code, for your reference, if there are mistaken. and please contact me! !
Update : 2024-05-04 Size : 10240 Publisher : 王小深
【Other】 packageone DL : 0: 背包算法和0-1背包算法,c++实现,希望对大家有帮助!-knapsack algorithm and 0-1 knapsack algorithm, c achieve, and I hope to be helpful!
Update : 2024-05-04 Size : 2048 Publisher : jun
【Data structs】 beibaowenti DL : 0: 这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
Update : 2024-05-04 Size : 1024 Publisher : chen
【Data structs】 backbagproblem DL : 0: 背包問題是關於最佳化的問題，要解最佳化問題可以使用「動態規劃」（Dynamic programming），從空集合開始，每增加一個元素就先求出該階段的最佳解，直到所有的元素加入至集合中，最後得到的就是最佳解。以背包問題為例，我們使用兩個陣列value與item，value表示目前的最佳解所得之總價，item表示最後一個放至背包的水果，假設有負重量 1～8的背包8個，並對每個背包求其最佳解-Knapsack problem is on the optimization problem, to solve optimization problems can be the use of
Update : 2024-05-04 Size : 4096 Publisher : 王凌云
【source in ebook】 beibao DL : 0: 关于背包的装载能力,用C++设计的程序,是著名的背包问题,相信大家在做实验报告时会遇到-On the loading capacity backpack with C++ Design procedure is well-known knapsack problem, I believe that to do experiments in the U.S. report, will encounter
Update : 2024-05-04 Size : 2048 Publisher : 夏阳
【Mathimatics-Numerical algorithms】 0-1knapback DL : 0: 用分支限界法求解背包问题（0/1背包） 1.问题描述：已知有N个物品和一个可以容纳TOT重量的背包，每种物品I的重量为Weight，价值为Value。一个只能全放入或者不放入，求解如何放入物品，可以使背包里的物品的总价值最大。 2.设计思想与分析：对物品的选取与否构成一棵解树，左子树表示装入，右表示不装入，通过检索问题的解树得出最优解，并用结点上界杀死不符合要求的结点。-Using branch and bound method to solve knapsack problem (0/1 knapsack) 1. Problem Description: known to have N of items and a TOT can accommodate the weight of backpacks, the weight of each item I for Weight, the value of Value. Add a can or not Add-wide, to solve how to Add items, the backpack can make the total value of the largest items. 2. The design and analysis: the selection of items or not constitute a solution tree, into the left subtree said, indicated that he did not load right, through the solution search tree reached the optimal solution, and the upper bound of node to kill refuses to comply with the requirements of nodes.
Update : 2024-05-04 Size : 1024 Publisher : 黄勇
【Algorithm】 0-1package DL : 0: 0-1背包问题的分支限界算法实现，有详细的函数功能说明 -0-1 knapsack problem branch and bound algorithm, a detailed description of the function function
Update : 2024-05-04 Size : 2048 Publisher : 古月
【Documents】 basicAlgorithm(pascal) DL : 0: 基本算法正稿包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、树的遍历；七进制转换；八全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory algorithm III knapsack problem four, sorting algorithm five, high-precision calculation six, tree traversal seven hexadecimal conversion eight wide array and combination generation 9. Search algorithm 10, greed 11, backtracking framework 12, DFS framework 13, BFS framework 15, data structure-correlation algorithm
Update : 2024-05-04 Size : 14336 Publisher : oh204
【Embeded-SCM Develop】 dongtaiguihua_01beibao DL : 0: vb环境下用动态规划方法编的0/1背包问题-vb environment made using dynamic programming method of 0/1 knapsack problem
Update : 2024-05-04 Size : 3072 Publisher : qj

« 1 2 3 45 6 7 8 9 10 ... 50 »