Location:
Search - beibao knapsack
Search list
Description: 分支定界的0/1背包问题-branch delimitation of the 0 / 1 knapsack problem
Platform: |
Size: 1703 |
Author: 姜艳艳 |
Hits:
Description: 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。
Platform: |
Size: 1844 |
Author: chj |
Hits:
Description:
Platform: |
Size: 313344 |
Author: 陈理 |
Hits:
Description: 分支定界的0/1背包问题-branch delimitation of the 0/1 knapsack problem
Platform: |
Size: 1024 |
Author: 姜艳艳 |
Hits:
Description: 0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
Platform: |
Size: 1024 |
Author: 杜丹 |
Hits:
Description: 关于背包的装载能力,用C++设计的程序,是著名的背包问题,相信大家在做实验报告时会遇到-On the loading capacity backpack with C++ Design procedure is well-known knapsack problem, I believe that to do experiments in the U.S. report, will encounter
Platform: |
Size: 2048 |
Author: 夏阳 |
Hits:
Description: 01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包...但它却是另一个重要的背包问题P02最简捷的解决方案,故学习只用一维数组解01背包问题是十分必要的。-01 knapsack problem subject N items and a capacity of V backpack. The first i items cost c [i], the value of w [i]. Solution which items will be loaded backpack ... but it is another important knapsack problem P02 the most simple and quickest solution, it is to learn only one-dimensional array of 01 knapsack problem solution is very necessary.
Platform: |
Size: 238592 |
Author: 0000 |
Hits:
Description: 算法，背包问题新解法，使用C-Algorithm, knapsack problem the new method, the use of C
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 数据结构典型问题，背包问题的求解源码，c-Typical data structure problem, Knapsack Problem Solving source, c
Platform: |
Size: 611328 |
Author: 钉子 |
Hits:
Description: 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。-0-1 knapsack problem (0-1 Knapsack Problem) is defined as: set up a collection on behalf of m items, respectively, the first positive integer value of items and weight, then the 0-1 knapsack problem KNAP (A, c) is defined as, A subset of demand, making less than the weight of the backpack and the capacity c, and make the value and the greatest.
Platform: |
Size: 2048 |
Author: chj |
Hits:
Description: 背包问题是计算机科学里的经典问题。在最简单的形式中，包括试图将不同重量的数据项放到 * 背包中．以使背包最后达到指定的总重量。不需要把所有的选项都放入背包中-Knapsack problem in computer science in the classic problems. In the simplest form, including different weights in an attempt to put data item* backpack. In order to reach the specified backpack final total weight. Do not need to put all the options are Add backpack
Platform: |
Size: 3072 |
Author: mosy |
Hits:
Description: 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功！-Retrospective method with 0-1 knapsack problem with vc++ Achieve that contains a complete source code has been tested successfully!
Platform: |
Size: 386048 |
Author: you shiming |
Hits:
Description: 背包问题
采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
-Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~
Platform: |
Size: 1024 |
Author: ohyoung |
Hits:
Description: 背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program
Platform: |
Size: 1024 |
Author: shangsheng |
Hits:
Description: 通过贪心算法实现背包问题，可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
Platform: |
Size: 250880 |
Author: piaoxue |
Hits:
Description: 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
Platform: |
Size: 247808 |
Author: chenchen |
Hits:
Description: 经典的背包问题九讲，讲述了关于背包问题的原理及其解法。-Nine classic knapsack problem, the story of the principle on the Knapsack Problem and Its Solution.
Platform: |
Size: 63488 |
Author: gdp |
Hits:
Description: 实现背包问题，可以直接运行！！！！欢迎下载-Knapsack problem to achieve, you can directly run! ! ! ! Welcome to download
Platform: |
Size: 1024 |
Author: mary |
Hits:
Description: 解决背包问题，使用贪心算法，源代码。使用C语言，调试通过-Solve the knapsack problem, use the greedy algorithm, the source code. Using C language, debugging through
Platform: |
Size: 175104 |
Author: 宋云辉 |
Hits:
Description: 0-1背包问题：给定n种物品和一个背包，物品i的重量是Wi，物品i价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大? 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包为1或不装入背包为0。不能将物品i装入背包多次，也不能只装入部分的物品i。0-1背包问题的主要特点是在选择物品i装入背包时，每种物品仅有一件，可以选择放或不放-0-1 knapsack problem: Given n types of items and a backpack, the weight of item i is Wi, the value of goods i Vi, backpack with a capacity of C. How to choose the items into the bag, making the backpack into the largest total value of goods? In the selection of the articles into the bag, the only two choices for each item i, that is loaded or not loaded backpack as a backpack 0. Items backpack i can not load times, can not just load some of the items i. The main features of the 0-1 knapsack problem is to choose items i loaded backpack, only one of each item, you can select the place or hold
Platform: |
Size: 1024 |
Author: 丁佩 |
Hits: