Search - knapsack

Search - knapsack - List

【Data structs】 bag DL : 0: 介绍了0-1背包问题的求解，并用贪心算法解决了背包问题-Introduced to solve 0-1 knapsack problem and solved with the greedy algorithm knapsack problem
Update : 2024-05-18 Size : 173056 Publisher : liuchuanhong
【JSP/Java】 TestKnapsack DL : 0: 0-1背包问题java算法及实现，使用java图形界面-0-1 knapsack problem java algorithm and implementation, the use of java GUI
Update : 2024-05-18 Size : 1024 Publisher : jack
【Data structs】 01beibao(dongtaiguihua) DL : 0: 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
Update : 2024-05-18 Size : 2048 Publisher : crp0289
【Data structs】 01beibao DL : 0: c++中运用动态规划解决01背包问题可以运行，有汉字说明-c++ using dynamic programming to solve the knapsack problem can run 01, with characters that ~ ~
Update : 2024-05-18 Size : 1024 Publisher : tmy5869
【Data structs】 Dynamic DL : 0: 使用动态规划解决背包问题，用C++语言实现-Knapsack problem using dynamic programming to solve, using C++ language
Update : 2024-05-18 Size : 1024 Publisher : 康遵强
【Mathimatics-Numerical algorithms】 01 DL : 0: 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
Update : 2024-05-18 Size : 6144 Publisher : 李崇帆
【AI-NN-PR】 c63b6cbef9ea DL : 0: 基于遗传算法的背包问题优化论文代码交叉编译选择-Knapsack problem based on genetic algorithm optimization of cross-compiled code selected papers
Update : 2024-05-18 Size : 1024 Publisher : zixialang
【AI-NN-PR】 ANT-TX DL : 0: 用蚁群算法和贪心算法解决0/1背包问题。可用于不同算法的比较。-Solving 0/1 Knapsack Problem by ant colony algorithm and greed method.Can be used to compare two algorithms.
Update : 2024-05-18 Size : 536576 Publisher : wangnan
【Mathimatics-Numerical algorithms】 1 DL : 0: 遗传算法解决0-1背包问题，动态规划算法-Genetic algorithm to solve 0-1 knapsack problem, dynamic programming algorithm
Update : 2024-05-18 Size : 3072 Publisher : chenxq
【Algorithm】 beibao DL : 0: 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
Update : 2024-05-18 Size : 2048 Publisher : 会员
【AI-NN-PR】 AI DL : 0: 利用遗传算法解决的背包问题，程序开发环境：Visual C++6.0-Using genetic algorithm to solve the knapsack problem, program development environment: Visual C++6.0
Update : 2024-05-18 Size : 3072 Publisher : 孔令辉
【File Format】 0-1bag DL : 0: 解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report
Update : 2024-05-18 Size : 46080 Publisher : lovewuhui
【Data structs】 01bag DL : 0: 0-1背包问题，采用了动态规划的算法，输入物品的重量和价值，以及背包的容量，计算出最优解-0-1 knapsack problem, using a dynamic programming algorithm ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~
Update : 2024-05-18 Size : 1024 Publisher : 陈昕昀
【Mathimatics-Numerical algorithms】 beibaowenti DL : 0: 背包问题的cpp源代码解法，使用c语言编写-Knapsack Problem Solution cpp source code, using c language
Update : 2024-05-18 Size : 8192 Publisher : amy
【Data structs】 huoxiang DL : 0: 0/1背包问题的k阶优化算法，k=0,1,2.-0/1 knapsack problem of k-order optimization algorithm, k = 0,1,2.
Update : 2024-05-18 Size : 281600 Publisher : fanwenyuan
【Data structs】 Dynamic-Programming DL : 0: 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsack problem
Update : 2024-05-18 Size : 2048 Publisher : 林达
【Data structs】 Backtracking DL : 0: 这是算法设计与分析课程实验，回溯算法实验的简单的源代码，包括回溯法背包问题，回溯符号问题。-This is the algorithm design and analysis course experiment, the experiment simple backtracking algorithm source code, including backtracking knapsack problem, the problem back symbol.
Update : 2024-05-18 Size : 1024 Publisher : 林达
【AI-NN-PR】 algorithm-of-heuristic- DL : 0: 本资料详细介绍了有关启发式算法的重要内容，包括模拟退火方法，遗传算法，动态规划，背包问题，对相关的研究有帮助。-This information details the important heuristic, including simulated annealing, genetic algorithms, dynamic programming, knapsack problem, the related research help.
Update : 2024-05-18 Size : 95232 Publisher : huangxi
【Mathimatics-Numerical algorithms】 Knapsack-problem DL : 0: 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。-Suppose a total volume of T can be packed into a backpack and n pieces of volume, respectively w1, w2, ..., wn items, items can be selected from n number of pieces is just filled with backpacks, even if w1+ w2+ ...+ wn = T, required to find all the solutions to meet the above conditions.
Update : 2024-05-18 Size : 14336 Publisher : 潇洒
【Other Web Code】 data-struct-program DL : 0: 一元稀疏多项式计算器、迷宫问题、成绩分析问题、图的基本操作与实现以及背包问题的求解-One yuan sparse polynomial calculator, maze, performance analysis of the problem, graph realization of the basic operations and the knapsack problem and the solution
Update : 2024-05-18 Size : 787456 Publisher : 陈晨

« 1 2 ... 40 41 42 43 44 4546 47 48 49 50 »