Search - knapsack

Search - knapsack - List

【Other】 Knapsack DL : 0: The Complete Algorithm for the Knapsack Problem via Dynamic Programming in C++.
Update : 2024-05-04 Size : 37888 Publisher : PooYan
【Other】 TSP DL : 0: 　提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu search techniques, using I & D strategies, while designed for the local optimal solution of the two kinds of mutation operator. The improved algorithm can effectively compensate for the standard tabu search algorithm depends on the initial solution defect, but also to avoid the phenomenon of search stagnation. Through specific examples and random-question test, indicating that the improved tabu search algorithm has better performance. Guan
Update : 2024-05-04 Size : 6144 Publisher : logspace
【JSP/Java】 Knapsack DL : 0: java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
Update : 2024-05-04 Size : 1024 Publisher : liangsi
【Data structs】 knapsack DL : 0: MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
Update : 2024-05-04 Size : 20480 Publisher : luckypig
【Data structs】 KnapsackProblem DL : 0: 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些物品重量的和大于M，要求所有选中要装入背包的物品总重量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
Update : 2024-05-04 Size : 1024 Publisher : lily
【Mathimatics-Numerical algorithms】 knapsack DL : 0: 0/1 Knapsack Problem
Update : 2024-05-04 Size : 1024 Publisher : aiqi
【Algorithm】 Knapsack DL : 0: Knapsack problem. Fractional knapsack,DDG, 0-1 knapsack are included
Update : 2024-05-04 Size : 76800 Publisher : Nisha
【Other】 BranchandBound_01backpack DL : 0: 0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.
Update : 2024-05-04 Size : 727040 Publisher : 储大为
【File Format】 multiplechoiceknapsack DL : 0: 关于多选择背包的很好的文章，提供了各种设计思路-Multiple Choice Knapsack Problem Example of planning choice in transportation
Update : 2024-05-04 Size : 390144 Publisher : amy
【Other】 KnapSack DL : 0: Program for KnapSack problem
Update : 2024-05-04 Size : 1024 Publisher : Neha
【Algorithm】 Knapsack DL : 0: Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added.
Update : 2024-05-04 Size : 2048 Publisher : jiangge
【Data structs】 backpack-ga-algorithm DL : 0: 背包问题或0-1背包问题遗传算法程序，里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned.
Update : 2024-05-04 Size : 2048 Publisher : olivejy
【Data structs】 Knapsack DL : 0: Knapsack,用贪心算法解决背包问题，Visual C++ 6.0编译-Knapsack, with a greedy algorithm to solve knapsack problem, Visual C++ 6.0 compiler
Update : 2024-05-04 Size : 2257920 Publisher : 草人
【Data structs】 GeneticAlgorithmsToSolveKnapsackProblem DL : 0: 用遗传算法解决背包问题，遗传算法的优势在于解决优化问题，对背包问题进行编码，然后随机产生使出样本，通过交叉，编译等操作来找到优化问题的解-Using genetic algorithms to solve knapsack problem, the advantage of genetic algorithms to solve optimization problem, knapsack problem is encoded, and then resorted to randomly generated sample, through the Cross, compiler and other operations to find the optimization problem
Update : 2024-05-04 Size : 927744 Publisher : Chen
【Algorithm】 KnapSack DL : 0: Fractional knapsack problem, Greedy algorithm
Update : 2024-05-04 Size : 408576 Publisher : Nguyen
【Other】 beibaoPSO DL : 0: 这份源代码是用粒子群算法解决0/1背包问题，可以正常运行。-The source code is the particle swarm algorithm to solve 0/1 knapsack problem, it works.
Update : 2024-05-04 Size : 1024 Publisher : 风暴
【JSP/Java】 Bag DL : 0: jcreator下写的背包问题，适合JAVA入门。给定背包的容量，在输入的物品中，求出符合条件的解，如果不存在解，则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the output does not exist
Update : 2024-05-04 Size : 2048 Publisher : 小文
【source in ebook】 the_design_and_analysis_of_algorithm DL : 0: 算法设计与分析全部作业及实验资料. 第1章最大覆盖问题第2章排列的字典序问题第3章 depot仓库布局问题第4章 priest繁忙的牧师第5章 egypt埃及分数问题第6章 squard方格移动问题第7章 work工作安排问题课堂算法连续背包问题课堂算法作业调度问题实验1 字典序问题实验2 高精度乘法实验3 0/1背包问题(DP) -Algorithm design and analysis of all operational and experimental data. Chapter 1, the maximum coverage problem Chapter 2 arranged in dictionary order problems Chapter 3 depot warehouse layout Chapter 4 priest busy pastor Chapter 5 egypt Egyptian fraction problems Chapter 6 squard box moving problem Chapter 7 work the organization of work class algorithm continuous knapsack problem class job scheduling algorithm experimental sequence of a dictionary experiment 2, high-precision multiplication experiment 3 0/1 knapsack problem (DP )
Update : 2024-05-04 Size : 1358848 Publisher : zgx
【Mathimatics-Numerical algorithms】 yichuansuanfa DL : 0: 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem.
Update : 2024-05-04 Size : 23552 Publisher : 施金泉
【ELanguage】 knapsack DL : 0: knapsack 0/1 n fractional
Update : 2024-05-04 Size : 2048 Publisher : vlynx

« 1 2 3 4 5 6 7 89 10 11 12 13 ... 50 »