Search - knapsack

Search - knapsack - List

【Data structs】 Dynamic-Program DL : 0: 动态规划的问题，有基础类的背包问题，邮局问题等，里面也有该类问题的源码-Dynamic programming problem, the knapsack problem with class-based, post offices and so on, which is also the source of such problems
Update : 2024-05-18 Size : 677888 Publisher : lijianglei
【Mathimatics-Numerical algorithms】 Java DL : 0: 骑士走棋盘、八个皇后、八枚银币、生命游戏、字串核对、双色、三色河内塔、背包问题-Knight walking the board, eight queens, eight silver, Game of Life, string matching, two-, three-color Hanoi Tower, knapsack problem, etc.
Update : 2024-05-18 Size : 709632 Publisher : congcong55
【Data structs】 07 DL : 0: 用堆栈实现0-1背包问题，以此了解递归实现的栈本质-0-1 knapsack problem with the stack implementation, in order to understand the recursive nature of stacks
Update : 2024-05-18 Size : 1024 Publisher : 猫熊
【Linux-Unix】 gpk-update-icon.txt.tar DL : 0: 实现背包问题的最优解，linux下编程，不会让你失望的-Knapsack problem to achieve the optimal solution, linux under the program will not let you down
Update : 2024-05-18 Size : 18432 Publisher : linhao
【Data structs】 01package DL : 0: 关于背包问题的实现，很好的代码，希望我们一起学习。-Knapsack problem on the realization of good code, I hope we learn together.
Update : 2024-05-18 Size : 1024 Publisher : 李晴
【matlab】 beibaoqiujie DL : 0: 用遗传算法计算背包问题的经典程序,word的文档里面有说明和程序。-Knapsack problem using genetic algorithm the classic program, word document which has instructions and procedures.
Update : 2024-05-18 Size : 26624 Publisher : 孙磊
【Data structs】 suanfa DL : 0: 背包问题的贪心算法解决办法，用链表和栈来实现的。 -Greedy algorithm for knapsack problem
Update : 2024-05-18 Size : 10240 Publisher : 陈鑫
【JSP/Java】 beibao DL : 0: 用java 实现动态规划求0-1背包问题两个实例包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
Update : 2024-05-18 Size : 9216 Publisher : 鱼
【Data structs】 beibao_9 DL : 0: 背包问题，经典的9个算法详细解析。每一个都有详细的讲解和代码分析-Knapsack problem, the classic algorithm detailed analysis of nine. Each with a detailed explanation and code analysis. .
Update : 2024-05-18 Size : 26624 Publisher : zhou
【matlab】 test-data-for-01-knapscap-problem DL : 0: 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
Update : 2024-05-18 Size : 4096 Publisher : 吴凡
【Data structs】 BagZeroOne DL : 0: 用java实现0/1背包问题贪心算法-the knapsack of using java
Update : 2024-05-18 Size : 5120 Publisher : liuxiaofei
【Data structs】 backnap-and-large-number- DL : 0: 使用队列类解决背包问题和使用线性表解决俄大数计算问题-Solve the knapsack problem using the queue class, and use the linear form of large numbers to solve computational problems Russia
Update : 2024-05-18 Size : 4096 Publisher : 蒋
【Data structs】 BOX DL : 0: 最少背包问题：假设有许多盒子，每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN，它们的重量分别是w1,w2,…,wN。目的是用尽可能少的盒子放入所有的项，任何盒子的重量不能超过他的容量。例如，如果想的重量为0.4, 0.4, 0.6和0.6，用两个盒子就能解决。按如下策略解决此问题：按给定的次序扫描每一个项，把每一个项放入能够容纳他而不至于溢出的最满的盒子。用优先级队列选择要装入的盒子。-Minimum knapsack problem: Suppose there are many boxes, each box can hold a total weight of 1.0. There are N items i1, i2, ..., iN, their weight are w1, w2, ..., wN. Purpose is to use as little as possible of all the items into the box, any box weight can not exceed his capacity. For example, if you want the weight of 0.4, 0.4, 0.6 and 0.6, with the two boxes can be solved. Strategy to solve this problem as follows: given the order by scanning each item, put each item into him and will not be able to accommodate the overflow of the most full of boxes. With a priority queue to select into the box.
Update : 2024-05-18 Size : 2048 Publisher : lijinping
【Data structs】 ep121 DL : 0: 用动态规划方法模拟0-1背包的问题，并包含了文件。-Simulation using dynamic programming methods 0-1 knapsack problem, and contains the file.
Update : 2024-05-18 Size : 1024 Publisher :
【AI-NN-PR】 PSObeibao DL : 0: 粒子群算法解决背包问题，使用PSO解决背包问题-PSO algorithm to solve the knapsack problem, solve the knapsack problem using PSO
Update : 2024-05-18 Size : 196608 Publisher : gq
【Data structs】 beibao DL : 0: 解决简单的背包问题，大学数据结构的实验内容-Solve simple knapsack problem, the University of the data structure of the experimental content
Update : 2024-05-18 Size : 1024 Publisher : 蔡优
【Data structs】 0-1beibao DL : 0: 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
Update : 2024-05-18 Size : 646144 Publisher : 菜鸟程序员
【Data structs】 knapsack_greedy DL : 0: 贪心法解背包问题，你懂得。。。。。。。20个子真麻烦-Greedy method to solve knapsack problem, you know. . . . . . .
Update : 2024-05-18 Size : 256000 Publisher : zhaoxuefeng
【Data structs】 01 DL : 0: 0-1背包问题，涉及到计算哪个背包加入了所选的结果中。-0-1 knapsack problem, which involves the calculation of the backpack to join the selected results.
Update : 2024-05-18 Size : 1024 Publisher : dfaf
【Data structs】 01Backpack DL : 0: 01背包问题的C++实现，包含Knapsack算法以及改进后的Knapsack算法。参考书籍：《算法设计与分析》。-01 knapsack problem of C++ implementation, including the Knapsack Knapsack algorithm and improved algorithm. Reference books: " Algorithm Design and Analysis."
Update : 2024-05-18 Size : 1024 Publisher : wendy

« 1 2 ... 42 43 44 45 46 4748 49 50 »