Search - knapsack

Search - knapsack - List

【Data structs】 dynamic-programming DL : 0: 使用c++语言，在vs2008平台上编写，用动态规划法求解0，1背包问题-C++ language use, in vs2008 platform to write, with the dynamic planning solution 0, 1 knapsack problem
Update : 2024-05-18 Size : 1024 Publisher : 闫皓渊
【Data structs】 arithmetic DL : 0: 采用c++语言实现动态规划问题、0-1背包问题、背包问题knap1.cpp、knap.cpp、dynamic.cpp！-The c++ language realize dynamic planning 0-1 knapsack problems knapsack problem knap1. CPP knap.CPP dynamic.CPP
Update : 2024-05-18 Size : 393216 Publisher : 房凌霄
【Data structs】 01-beibao DL : 0: 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
Update : 2024-05-18 Size : 886784 Publisher : 马兴江
【Data structs】 beibao3.10 DL : 0: 回溯法解决0-1背包问题算法分析与设计实验-Backtracking to solve 0-1 knapsack problem
Update : 2024-05-18 Size : 751616 Publisher : 薛佩佩
【Data structs】 MAOS_QKP_1.001 DL : 0: 用于解决二次背包问题的多代理优化系统，推荐研究学习一下-MAOS-QKP is a multiagent optimization system (MAOS) for solving the Quadratic Knapsack Problem (QKP).
Update : 2024-05-18 Size : 702464 Publisher : 万万
【Data structs】 bag DL : 0: 本程序解决背包问题，其中有多个类型的物品，每类物品可以有任意数量。-The procedure to solve knapsack problem, in which there are multiple types of items, each class can have any number of items.
Update : 2024-05-18 Size : 1024 Publisher : chen
【Data structs】 knapsack DL : 0: 背包九讲问题，各种高效解法，值得一看，包括01背包，完全背包，多重背包，一起三种背包的混合问题-Backpack nine speak problems, all kinds of efficient solution, is worth a look Including 01 backpack, completely backpack, multiple backpack, together three backpack of the mixed problem
Update : 2024-05-18 Size : 36864 Publisher : smile
【AI-NN-PR】 beibaowenti DL : 0: 主要采用遗传算法解决背包问题。是值得学习算法。-By using the genetic algorithm to solve the main knapsack problem. Is worth learning algorithm.
Update : 2024-05-18 Size : 6144 Publisher : 张建厂
【AI-NN-PR】 C.GA DL : 0: 遗传算法解决组合优化问题，0-1背包问题-Genetic algorithm to solve combinatorial optimization problems, 0-1 knapsack problem
Update : 2024-05-18 Size : 11264 Publisher : whx
【Data structs】 bag DL : 0: C++语言编制的一般背包问题，可用于一般的算法实验-General knapsack problem
Update : 2024-05-18 Size : 214016 Publisher : kxm
【AI-NN-PR】 0-1beibao DL : 0: 蚁群算法求解0-1背包问题，压缩包中有详细的代码和实验报告，可以调试运行-Ant Colony Algorithm for the 0-1 knapsack problem, compressed package are detailed in the code and lab reports, debugging and running
Update : 2024-05-18 Size : 1217536 Publisher : 张小
【Data structs】 Backbag DL : 0: 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization problem of NP complete. Problems can be described as: given a set of items, each item has its own weight and price, in limited within the total weight of, how we choose, can make the total price of goods is the highest. The name of the problem comes from how to select the most suitable items placed in a given in the backpack.
Update : 2024-05-18 Size : 961536 Publisher : 方期待
【matlab】 beibaoPSO DL : 0: 粒子群算法解决0-1背包问题，对于n个体积为aj、价值分别为cj的物品，如何将它们装入总体积为b的背包中，使得所选物品的总价值最大。-Particle swarm algorithm to solve the 0-1 knapsack problem, for n volume for aj, value for cj items, how they are loaded in the total volume of the backpack, b, making the total value of the selected items.
Update : 2024-05-18 Size : 1024 Publisher : whl
【Data structs】 beibaoV2 DL : 0: 背包问题，算法问题研究，这个是本书，大家共同参考，算法竞赛需要的。-Knapsack problems, the algorithm research problems, this is this book, everyone to reference, the algorithm of competition needs.
Update : 2024-05-18 Size : 276480 Publisher : baoliguo
【Mathimatics-Numerical algorithms】 kp DL : 0: 在C++环境下，基于遗传算法解决背包问题。-In the C environment, based on genetic algorithm to solve the knapsack problem.
Update : 2024-05-18 Size : 3072 Publisher : 都好打
【Data structs】 dsadsa DL : 0: 贪心算法的实现：1、最优装载实现 2、 0-1背包问题实现. -The greedy algorithm implemented: 1, the optimal load the implementation 2, knapsack problem is realized.
Update : 2024-05-18 Size : 31744 Publisher : 宇文
【JSP/Java】 Knapscak DL : 0: Knapsack Problem using java applet
Update : 2024-05-18 Size : 27648 Publisher : akash
【Data structs】 Dynamic-programming-DP-backpack DL : 0: 用动态规划算法解决DP背包问题，采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
Update : 2024-05-18 Size : 871424 Publisher : lydia
【Data structs】 beipaowenti DL : 0: 背包算法的c++简单实现，很有用的，可以-Knapsack algorithm
Update : 2024-05-18 Size : 1024 Publisher : 韵
【Data structs】 knap-error DL : 0: 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
Update : 2024-05-18 Size : 1024 Publisher : wangxuejun

« 1 2 ... 44 45 46 47 48 4950 »