搜索资源列表
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the
01
- 01背包问题的经典实现。在VC6下面调试通过。学习算法的朋友可以借鉴一下
背包回素法
- 01背包 用的是回素法经测试可以用的 第一次上传情大家指教
Solving.the.01.Knapsack.Problem.with.Genetic.Algor
- 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。
Knapsack
- 用遗传算法解决01背包问题，内附测试数据。-Using genetic algorithms to solve knapsack problem 01, enclosing the test data.
01knapsackMFC
- 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
GA
- 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm t
01pack
- 用动态规划，贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
jinjisousuobeibao
- 禁忌搜索求解01背包问题，VC++6.0编译通过，有运行结果显示-01 Tabu Search for solving knapsack problems, VC++6.0 to compile, run the results are
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
01-knapsack-problem
- 01背包问题的解决方法很多，下面用遗传算法解决01背包问题-01 knapsack problem genetic algorithm to solve
01-knapsack-problem1
- 01背包问题，有很多方法可以解决，下面采用动态规划的方法。-01 knapsack problem, there are many ways to solve
01
- 数学建模中的动态规划思想解决01背包问题。 包含整个c工程，内容完整，可运行。-Mathematical modeling of dynamic programming to solve 01 knapsack problem. C contains the entire project, content integrity, operational.
01-beibao
- 动态规划求解01背包 vc6.0-dynamic programming 0/1 knapsack
01
- 利用回溯法求01背包问题,包含了很多内容-it is good
TSPandBAGproblem
- 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is
01-backpack--quick-sort-algorithm
- 本文档涉及01背包，快速排序，归并排序，单源点最短路径等算法-This document covers 01 backpack, quick sort, merge sort, single-source shortest path algorithm
01
- 01背包问题是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。-01 knapsack problem is the M items removed several pieces on the space W of a backpack, each item has a volume of W1, W2 ...... Wn, with the corresponding value of P1, P2 ...... Pn.