Location:
Search - Knapsack Java
Search list
Description: 0-1背包问题算法在java语言的实现程序-0-1 knapsack problem algorithm java language in the realization process
Platform: |
Size: 1024 |
Author: 成成 |
Hits:
Description: 蚁群算法源代码（附带蚁群算法在0-1背包问题和TSP问题中的应用资料两篇）-Ant colony algorithm source code (with ant colony algorithm in the 0-1 knapsack problem and the TSP data Problem 2)
Platform: |
Size: 690176 |
Author: chen |
Hits:
Description: 算法中一个经典问题：背包问题的优先队列算法实现。-Algorithm for a classical problem: Knapsack Problem realize the priority queue algorithm.
Platform: |
Size: 3072 |
Author: 莫海波 |
Hits:
Description: 此小程序用java实现了可以分割的背包问题，开发平台是Eclipse。其中主要是用贪心算法实现背包问题，在将物品进行排序时，没有使用经典的merge-sort算法，而是直接使用了java中Arrays类的sort的方法，但要自己定义类，实现接口Comparator。-This small program using java realize the knapsack problem can be separated from the development platform is Eclipse. Which is mainly used greedy algorithm knapsack problem, sort the items in when not using the classic merge-sort algorithm, but the direct use of java in the Arrays class sort method, but their definition of class, realize interface Comparator.
Platform: |
Size: 21504 |
Author: gengxin |
Hits:
Description: 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that can solve this problem.
Platform: |
Size: 4096 |
Author: gengxin |
Hits:
Description: 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。-Genetic Algorithm for Knapsack Problem 01 experimental report references. If you read this procedure should not understand the genetic algorithm or clever, then it is better not to look at this issue.
Platform: |
Size: 201728 |
Author: gouyabin |
Hits:
Description: //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
Platform: |
Size: 1024 |
Author: ss |
Hits:
Description: 提供一个用Java实现背包问题的解法，如果有必要可以自行修改相关参数后再做仿真-Used to provide a Java implementation of the solution of knapsack problem and, if necessary modify the relevant parameters can then make simulation
Platform: |
Size: 1024 |
Author: XiongRunqun |
Hits:
Description: 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.
Platform: |
Size: 157696 |
Author: 王若 |
Hits:
Description: Solving Knapsack Using Java and CPLEX
Platform: |
Size: 1024 |
Author: xaxis |
Hits:
Description: 0-1背包
给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？
Platform: |
Size: 1024 |
Author: 拉力 |
Hits:
Description: 经典的背包问题用分支限界法实现的JAVA代码-Classical knapsack problem using branch and bound method of the JAVA code
Platform: |
Size: 2048 |
Author: L |
Hits:
Description: 经典的背包问题用回朔法实现的JAVA代码-Knapsack problem with the classic method of retrospective JAVA code
Platform: |
Size: 1024 |
Author: L |
Hits:
Description: 一些很经典的算法！！！包括八皇后问题和背包问题，排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues.
Platform: |
Size: 693248 |
Author: |
Hits:
Description: java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
Platform: |
Size: 1024 |
Author: liangsi |
Hits:
Description: 问题：已知有n种物品和一个可容纳M重量的背包，每种物品i的重量为wi。假定将物品i的一部分xi放入背包就会得到pixi的效益，这里，0≤xi≤1，pi>0。如果这些
物品重量的和大于M，要求所有选中要装入背包的物品总重
量不得超过M，而装入背包物品获得的总效益最大。-Question: are known to have n kinds of goods and M can hold the weight of a backpack, the weight of each item i is wi. I assume that part of the item into the knapsack xi get pixi benefits, where, 0 ≤ xi ≤ 1, pi> 0. If the weight of these items is greater than M, requires that all selected items to be loaded backpack should not exceed the total weight of M, while the total load backpack items were the biggest benefits.
Platform: |
Size: 1024 |
Author: lily |
Hits:
Description: 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
Platform: |
Size: 1024 |
Author: 岚 |
Hits:
Description: Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added.
Platform: |
Size: 2048 |
Author: jiangge |
Hits:
Description: jcreator下写的背包问题，适合JAVA入门。给定背包的容量，在输入的物品中，求出符合条件的解，如果不存在解，则输出不存在-jcreator written under the knapsack problem, for JAVA entry. Given knapsack capacity, in input items, find qualified solution, if there is no solution, the output does not exist
Platform: |
Size: 2048 |
Author: 小文 |
Hits:
Description: 老师给的用Java编写的算法，包括背包问题，
回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
Platform: |
Size: 1267712 |
Author: 小黑 |
Hits: