Location:
Search - knapsack
Search list
Description: 用混和遗传算法求解0-1背包问题 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题-The hybrid genetic algorithm to solve knapsack problem
Platform: |
Size: 2048 |
Author: 陈凯 |
Hits:
Description: 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
Platform: |
Size: 2048 |
Author: 邵文莎 |
Hits:
Description: 0-1背包的回溯算法求解实例，用于初学者的学习使用。-0-1 knapsack backtracking algorithm instance, learning to use for beginners.
Platform: |
Size: 3072 |
Author: qizhuang |
Hits:
Description: 用c语言编写的背包问题的算法设计，属于控制台编程-Knapsack problem using the c language algorithm design, and a console programming
Platform: |
Size: 1024 |
Author: helloworld |
Hits:
Description: 基于mfc的可视化窗口的背包问题，简单直观-Based the mfc visualization window knapsack problem, a simple and intuitive
Platform: |
Size: 1879040 |
Author: 谢伟月 |
Hits:
Description: 逻辑回归的jar包和示例程序，可以处理背包问题和其它的逻辑回归问题-Logistic regression jar package to deal with the knapsack problem
Platform: |
Size: 214016 |
Author: zhong |
Hits:
Description: 这是我们大学里的课程设计，实现简单的0、 1背包问题，目的就是用最少的资源做做多的事情-
This is our university course design, realization simple 0, 1 knapsack problem, the purpose is to use the minimal resource do more things
Platform: |
Size: 1024 |
Author: 李维 |
Hits:
Description: 熟悉C/C++语言的集成开发环境；通过本实验加深对分治法、贪心算法的理解。掌握贪心算法、动态规划和回溯算法的概念和基本思想，分析并掌握"0-1"背包问题的三种算法，并分析其优缺点。-Master the greedy algorithm, the dynamic programming algorithm and back of the concept and basic thought, analysis and master "0-1" knapsack problem three algorithm, and their advantages and disadvantages are analyzed.
Platform: |
Size: 126976 |
Author: 武楠 |
Hits:
Description: 标准遗传算法背包问题，标准遗传算法，背包问题，源码注释-standard genetic algorithm ——knapsack problem
Platform: |
Size: 2048 |
Author: jj |
Hits:
Description: 该算法主要是用贪心算法求解背包问题。背包问题应用TSP问题也非常广泛-The algorithm is the greedy algorithm for knapsack problem.
Platform: |
Size: 1024 |
Author: 王莉 |
Hits:
Description: 基于多目标的PSO用于解决背包问题的程序，运行上比较花时间，请耐心等待。-Procedures used to solve the knapsack problem based on multi-objective PSO run more to spend time, please be patient.
Platform: |
Size: 3072 |
Author: 王力波 |
Hits:
Description: 动态规划求0/1背包问题,是一个或多个物品的重量和价值,数组中的每个元素定义一趟需要记录的数据-Dynamic programming 0/1 knapsack problem is the weight and value of one or more items, each array element defines a trip record data
Platform: |
Size: 1024 |
Author: 袁昊苏 |
Hits:
Description: 分支限界法解决01背包问题，适用于算法上机作业-Branch and bound method to solve the 01 knapsack problem
Platform: |
Size: 1024 |
Author: as |
Hits:
Description: 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为C。问应如何选择装入背包的物品，使得装入背包中物品的总价值最大?-Given the n kinds of goods and a backpack. The weight of the items i wi, the value of vi, the knapsack of capacity C Asked how to select the items of the loaded backpack, making the load items in the backpack the total value of?
Platform: |
Size: 1024 |
Author: Annie |
Hits:
Description: knapsack algen with genetick algorthm
Platform: |
Size: 585728 |
Author: dinda |
Hits:
Description: 背包问题的资料，可以用来做多数背包问题。我认为是很好的使用工具-Knapsack problem that can be used to do most of the knapsack problem. I think it is good to use tools
Platform: |
Size: 504832 |
Author: james lamibs |
Hits:
Description: 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
Platform: |
Size: 1024 |
Author: 禾子 |
Hits:
Description: 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
Platform: |
Size: 1024 |
Author: 禾子 |
Hits:
Description: 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
Platform: |
Size: 1024 |
Author: 禾子 |
Hits:
Description: 背包问题的解决，，实现在最大载重量下利润最大化的问题-The solution of the knapsack problem
Platform: |
Size: 1024 |
Author: 李洋 |
Hits:
«
1
2
...
45
46
47
48
49
50»