搜索资源列表
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
0-1Knapsack.problem
- Knapsack problemnew01背包问题（动态规划） 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
knapsack
- 九讲背包问题。一本很好的算法书，详细讲解了背包问题。-Nine speakers knapsack problem. A good algorithm book, explain in detail the knapsack problem.
zero_one_question
- 算法中的经典问题：0——1 背包问题 在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
LinerArange
- 动态规划方法视线特殊的（0，1，2）背包问题，获得最佳的物品取舍方案-Dynamic programming special attention (0,1,2) knapsack problem, obtain the best trade-off program items
Knapsack
- 我自己做的一个0-1背包问题程序 用回溯法 做的 望大家分享 请指正-I own a 0-1 knapsack problem with retroactive law procedures do hope to share, please correct me
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
Knapsack-problem
- 背包问题 言简意赅 易懂易学 一学就会-Knapsack problem concisely and a school will learn to understand
Knapsack-problem
- 背包问题（Knapsack Problem）的解法源代码，修改参数即可使用-Knapsack Problem source code, modify the parameters can be used
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。用2种方法实现背包问题，用C语言编写，数据结构课内试验-Knapsack problem (Knapsack problem) is NP-complete combinatorial optimization problem. Problem can be described as: Given a se
0-1-knapsack-problem
- 01背包是在M件物品取出若干件放在空间为W的背包里，每件物品的体积为W1，W2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。在本例中所有数值均为整数-01 M items in the backpack is out of a number of pieces on the space W of the backpack, the size of each item as W1, W2 ... ... Wn, corresponding to the value of
01-knapsack-problem
- 使用c++实现了0-1背包问题的算法，根据要求找出最佳的选项放入背包-Using c++ implementation of the 0-1 knapsack problem algorithms required to find the best option backpack
knapsack-problem
- 原创，背包问题的四种解法，回溯法，动态规划法，以及两种蛮力法，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
Knapsack-problem(DP)
- 本文档详细分析了动态规划的经典模型-背包问题，能够有效强化对该类型算法的理解。-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.
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
Knapsack-problem
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-Knapsack problem
Knapsack-problem
- 可以解决背包问题，背包问题是一种组合优化的NP问题，选择最合适的物品放置于给定背包-Knapsack problem