Search - knapsack

Search - knapsack - List

【Other】 DataStruct DL : 0: 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。 tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package
Update : 2024-05-04 Size : 374784 Publisher : zouyan
【Other】 01bagProblemGreedy DL : 0: 0／1背包问题的贪心优化解法邓宏涛朱蜘 (江汉大学数学与计算机学院武汉430056) 摘要：介绍了0／1背包问题的基本贪心算法的解决策略，通过对贪心算法的改进和优化，找出0／1背包问题的最优解的很好近似。-0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation.
Update : 2024-05-04 Size : 175104 Publisher : qqq
【Data structs】 knapback DL : 0: 背包问题的最优并行算法，毕业设计，利用分治策略-Knapsack problem of the optimal parallel algorithm, graduation design, the use of sub-rule strategy
Update : 2024-05-04 Size : 313344 Publisher : syzqgj
【VC/MFC】 knapbagoperation DL : 0: 利用visual c++,基于非超递增背包公钥体制_大数运算-Use visual c++, based on non-super-increasing knapsack public-key computing system of large numbers _
Update : 2024-05-04 Size : 125952 Publisher : syzqgj
【JSP/Java】 knapsack DL : 0: Solving Knapsack Using Java and CPLEX
Update : 2024-05-04 Size : 1024 Publisher : xaxis
【matlab】 KnapsackProblem DL : 0: 这是用MATLAB编写的模拟退火算法求解背包问题的程序-This is prepared using MATLAB algorithm simulated annealing procedure for Knapsack Problem
Update : 2024-05-04 Size : 8192 Publisher : 刘翔
【File Operate】 knap DL : 0: this file solve 0/1 knapsack problem
Update : 2024-05-04 Size : 5120 Publisher : morteza
【Mathimatics-Numerical algorithms】 Knapsack DL : 0: 0-1背包给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
Update : 2024-05-04 Size : 1024 Publisher : 拉力
【ActiveX/DCOM/ATL】 evo-knapsack DL : 0: pdf for evolutionary computing of knapsack
Update : 2024-05-04 Size : 328704 Publisher : farhad
【AI-NN-PR】 monituihuo_beibao DL : 0: 模拟退火算法解决背包问题，使得背包能得到最好的利用。-Simulated annealing algorithm to solve knapsack problem, the backpack can be the best possible use.
Update : 2024-05-04 Size : 2048 Publisher : 张苹
【Other】 KITBAG DL : 0: 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort algorithm to sort items in accordance with the smallest unit, and then choose to greed.
Update : 2024-05-04 Size : 1024 Publisher : workfuture
【Data structs】 backpackbranchandbound DL : 0: 这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm
Update : 2024-05-04 Size : 179200 Publisher : yangke
【Windows Develop】 knapsack_win DL : 0: 多目标背包问题的源码希望对大家有用很经典的从Ziztler哪里得到的-Multi-objective knapsack problems code
Update : 2024-05-04 Size : 62464 Publisher : brue yang
【matlab】 SA DL : 0: 这是用模拟退火算法解决0-1背包问题，下载后可直接运行，可以帮助有需要对模拟退火算法进行了解的朋友。-This is a simulated annealing algorithm to solve the 0-1 knapsack problem, after downloading, can be directly run, you can help those in need of the simulated annealing algorithm to find out about friends.
Update : 2024-05-04 Size : 1024 Publisher : 小吴
【Other】 knapsack DL : 0: 0-1 knapsack function solved using dynamic programming
Update : 2024-05-04 Size : 88064 Publisher : kapil
【Data structs】 knapsack DL : 0: 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
Update : 2024-05-04 Size : 1024 Publisher : hyqin
【Other】 KnapsackProblem DL : 0: 基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the probability of selection, crossover is a two-point random crossover and mutation is the probability of mutation
Update : 2024-05-04 Size : 2048 Publisher : 田文杰
【MPI】 pso_01 DL : 1: 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
Update : 2024-05-04 Size : 10240 Publisher : waterjj
【Other】 01bag DL : 0: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
Update : 2024-05-04 Size : 1052672 Publisher : hehuiling
【Linux-Unix】 knapsack DL : 0: it a code for knapsack
Update : 2024-05-04 Size : 1024 Publisher : Dilpreet

« 1 2 3 4 5 6 78 9 10 11 12 ... 50 »