Search - knapsack

Search - knapsack - List

【JSP/Java】 beibao77 DL : 0: 背包问题清华大学出版社的《算法与设计分析》（第2版）中的实验 -Tsinghua University Press, the knapsack problem, " Algorithm Analysis and Design" (2nd edition) in the experimental
Update : 2024-05-18 Size : 1024 Publisher :
【Data structs】 0-1bag DL : 0: 解决了0-1背包问题，能够的出最优解；并且可以知道各个背包的号码和总重量。-To solve the 0-1 knapsack problem, to the optimal solution and can know each number and total weight of the backpack.
Update : 2024-05-18 Size : 317440 Publisher : nengwei
【Data structs】 LV-backtrack01PACKING DL : 0: 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Given n types of items and a backpack. Item i is the weight wi, the value of vi, backpack capacity of c. Asked how to choose the items into the backpack, backpack into making the total value of the largest items. In the choice of loading backpack items, for each item i have only two choices, that is not loaded into a backpack or bag. Items into the backpack i can not be repeated, and not only into some of the items i. Therefore, the problem is called 0-1 knapsack problem.
Update : 2024-05-18 Size : 104448 Publisher : JLH
【Data structs】 package DL : 0: 数据结构和算法分析的相关内容，这里是0/1背包问题的相关代码，将有助于你更好的学习相关内容。-Data structures and algorithm analysis of relevant content, here is the 0/1 knapsack problem related to code, will help you better learn the relevant content.
Update : 2024-05-18 Size : 3878912 Publisher : chen
【Algorithm】 branchknapser DL : 0: 本程序实现分支界限算法求解0-1背包问题，c语言-The boundaries of the program to achieve branch 0-1 knapsack problem algorithm, c language
Update : 2024-05-18 Size : 3072 Publisher : 发奋图强
【AI-NN-PR】 geneknapser DL : 0: 本程序实现遗传算法求解0-1背包问题，c语言-The genetic algorithm program to achieve 0-1 knapsack problem, c language
Update : 2024-05-18 Size : 3072 Publisher : 发奋图强
【MPI】 knappara DL : 0: 本程序实现0-1背包问题的遗传算法的并行计算，mpi+c语言-This procedure achieved 0-1 knapsack problem genetic algorithm parallel computing, mpi+ c language
Update : 2024-05-18 Size : 11264 Publisher : 发奋图强
【Data structs】 beibao DL : 0: 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
Update : 2024-05-18 Size : 1024 Publisher : liuyanan
【Data structs】 package DL : 0: 经典的01背包问题，采用动态规划算法，C语言编写-01 classic knapsack problem, using the dynamic programming algorithm, C language
Update : 2024-05-18 Size : 196608 Publisher : yy
【matlab】 Udec2bin DL : 0: 本程序为我自己编写的，能够实现用枚举法背包问题-This program written for my own, to achieve knapsack problem with the enumeration method
Update : 2024-05-18 Size : 1024 Publisher : 李华
【matlab】 aa DL : 0: 在过去的几年中, 背包问题吸引了众多理论研究人员和应用工作者的注意力, 因而得到了广泛而深入的研究。理论方面, 研究兴趣主要来自于该问题简单的结构, 而这种特点既可以深入探索许多组合特性, 又可以通过解决一系列背包子问题来最终求解更为复杂的优化问题。实践方面, 这些问题可以表述许多工业场合的应用, 最典型的应用包括货物装载、存储分配和资本预算等等。在寻找背包问题可行解的过程中, 出现了众多的算法, 本文是利用MATLAB 程序求背包问题可行解的一种算法。-In the past few years, knapsack problem has attracted many researchers and application of theoretical attention of workers, which has been extensive and in-depth study. Theory, research interest mainly from the simple structure of the problem, and this characteristic combination of both in-depth exploration of many features, but also can solve a series of knapsack sub-problems to solve more complex final optimization problem. Practice, these problems can be expressed in many industrial applications where the most typical applications include cargo loading, storage, distribution and capital budgets, and so on. Knapsack problem in finding feasible solutions in the process, there have been many algorithms, this is the knapsack problem using MATLAB program seeking a feasible solution algorithm.
Update : 2024-05-18 Size : 24576 Publisher : hh
【AI-NN-PR】 yingyongGAjiejue0-1beibaowenti DL : 0: 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm combined to form hybrid genetic algorithm, and solve the classic knapsack problem.
Update : 2024-05-18 Size : 5120 Publisher : 齐青萍
【AI-NN-PR】 0-1knapsack DL : 0: 解决0-1背包问题，是算法设计与分析5.6节内容-Solve the 0-1 knapsack problem
Update : 2024-05-18 Size : 18432 Publisher : 李行水
【WEB Code】 dietsehat DL : 0: This a php code for solving knapsack problem-This is a php code for solving knapsack problem
Update : 2024-05-18 Size : 324608 Publisher : veronica
【Data structs】 a DL : 0: 贪心法求0/1背包已知背包的容量和物品的个数和重量价值 -The greedy algorithm to find 0/1 knapsack
Update : 2024-05-18 Size : 1024 Publisher : 陆逸冰
【Data structs】 non0_1-Knapsack-and-full-sorting DL : 0: 这是全排序算法和非零一背包问题的简单实现，程序可以正确运行。-This is the simple realization of the whole sorting algorithm and the non0_1 kanpsack problem, the program correctly.
Update : 2024-05-18 Size : 1024 Publisher : 小韩
【Data structs】 Greed DL : 0: 利用贪心算法解决“部分背包问题”。这是个经典算法，实现的也比较完善，易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
Update : 2024-05-18 Size : 1024 Publisher : 洛菲雨
【Data structs】 suanfa2 DL : 0: 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscript.
Update : 2024-05-18 Size : 41812992 Publisher : 李诗诗
【Data structs】 01packet DL : 0: 使用分支限界法解决01背包问题，c++代码实现，能够正确运行-Using the branch and bound method to solve the 01 knapsack problem, c++ code to run properly
Update : 2024-05-18 Size : 897024 Publisher : Rhonda
【Mathimatics-Numerical algorithms】 suanfashiyan DL : 0: 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic programming (multi-segment Figure 0-1 backpack, resource allocation), backtracking and branch and bound method (sub-set several issues)
Update : 2024-05-18 Size : 3476480 Publisher : 钟英

« 1 2 ... 43 44 45 46 47 4849 50 »