Search - knapsack

Search - knapsack - List

【matlab】 knapsack DL : 0: knapsack solve problem dynamic algorithm
Update : 2024-05-18 Size : 1024 Publisher : emtec1959159
【Data structs】 knapsack-problem DL : 0: 原创，背包问题的四种解法，回溯法，动态规划法，以及两种蛮力法，C++代码，编译运行通过，结果正确，可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare the efficiency of the method.
Update : 2024-05-18 Size : 2451456 Publisher : ZLS
【Data structs】 knapsack DL : 0: knapsack problem solution
Update : 2024-05-18 Size : 1024 Publisher : M.Azeem
【Mathimatics-Numerical algorithms】 0-1-knapsack-problem-solution DL : 0: 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
Update : 2024-05-18 Size : 2156544 Publisher : 哈达
【Data structs】 Knapsack DL : 0: knapsack algo demo version
Update : 2024-05-18 Size : 93184 Publisher : Yuekui Ruan
【Data structs】 KNAPSACK DL : 0: 背包问题,动态规划实现了01背包和贪心算法部分背包-Knapsack problem, 01 backpack and full backpack
Update : 2024-05-18 Size : 1024 Publisher : fxd
【matlab】 Knapsack-problem-with-GA DL : 0: solving knapsack 0,1 problem with GA in matlab
Update : 2024-05-18 Size : 1024 Publisher : maneshti
【Data structs】 knapsack DL : 0: Knapsack problem is a classic dynamic programming model. It is both simple image easier to understand, and to some extent to peel And the nature of the dynamic programming, so many textbooks used it as a dynamic programming part, the first sample question, I also put it in
Update : 2024-05-18 Size : 315392 Publisher : 张阳
【Mathimatics-Numerical algorithms】 optimal-for-knapsack-probelm DL : 0: 背包问题的多项式优化算法，实现了对目前用到的背包问题的算法的改进-an optimal algorithms for knapsack probelm
Update : 2024-05-18 Size : 13312 Publisher : nihai
【matlab】 knapsack DL : 0: 01背包问题的matlab的实现，方便大家下载学习。-01 knapsack problem matlab realize, convenient download learning.
Update : 2024-05-18 Size : 2048 Publisher : Charles
【Data structs】 Knapsack-problem(DP) DL : 0: 本文档详细分析了动态规划的经典模型-背包问题，能够有效强化对该类型算法的理解。-This document is a detailed analysis of the classic model of the dynamic programming- knapsack problem, can effectively enhance the understanding of this type of algorithm.
Update : 2024-05-18 Size : 31744 Publisher :
【Other】 Based-on-the-Matlab-knapsack- DL : 0: 基于Matlab的0_1背包问题的动态规划方法求解-Based on the Matlab 0_1 knapsack problem, dynamic programming method for solving
Update : 2024-05-18 Size : 177152 Publisher : 刘强
【assembly language】 0-1-knapsack-problem-matlab DL : 0: 关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
Update : 2024-05-18 Size : 16384 Publisher : 鲍文正
【AI-NN-PR】 knapsack DL : 0: knapsack问题，用LocalSolver求解，可以免费试用于学习。-knapsack for learning freely with LocalSolver a slover with LocalSolver corporation.
Update : 2024-05-18 Size : 7177216 Publisher : suntoward
【VC/MFC】 Knapsack-problem DL : 0: 详细讲解背包问题，背包问题（Knapsack problem）是一种组合优化的NP完全问题。-Explain in detail the knapsack problem, the knapsack problem (Knapsack problem) is a combinatorial optimization NP-complete problem.
Update : 2024-05-18 Size : 29696 Publisher : longqiang
【Documents】 QEA-solving-0-1-Knapsack-problem DL : 0: 主要是利用QEA解决0-1背包问题的程序-It isuseful to solving the problem of 0-1 Knapsack using QEA
Update : 2024-05-18 Size : 93184 Publisher : yanyanyan
【Data structs】 Knapsack DL : 0: 背包问题（0-1背包和完全背包）动态规划代码-Code for Knapsack Problem using Dynamic Programming
Update : 2024-05-18 Size : 246784 Publisher : 小魏
【Algorithm】 Knapsack-problem-based-on-GA DL : 0: 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper first introduces the basic principles of the basic genetic algorithm, the characteristics of its basic implementation techniques, and then for the knapsack problem, discusses the genetic algorithm coded representation and genetic operators (including selection operator, crossover operator mutation operator three count sub), and other aspects of the application. And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators. Finally, a brief description of the genetic algorithm Knapsack problem and genetic algorithm to solve the knapsack problem prospects prospect.
Update : 2024-05-18 Size : 420864 Publisher : 李海波
【JSP/Java】 solution-of-knapsack-problem DL : 0: 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, branch and bound method understanding.
Update : 2024-05-18 Size : 90112 Publisher : 丁
【Technology Management】 Knapsack DL : 0: Knapsack and work good i hope
Update : 2024-05-18 Size : 2048 Publisher : king

« 1 2 ... 6 7 8 9 10 1112 13 14 15 16 ... 50 »