knapsack-problem

相关标签：javascript jquery android 多少钱 iPhone

Logic form getting Minimum UpperBound for a given Number from the set of numbers

My problem is as follows- I have some numbers with me, like below- 2 2 2 2 3 3 17 17 17 17 17 17 17 17 1开发者_Python百科7[详细]

2023-03-03 00:30 分类：问答
Knapsack using GA

I have not asked about the knapsack problem using a genetic algorithm. the initialization I use this kind of chromosomes [1] = [weight] [profit], because his formula KP on chromosome evaluation weight[详细]

2023-02-26 07:34 分类：问答
Find tracks that match group by length

can someone please come up with a solution to this problem, in programming language of choice (preferably Python, but anything could be fine I guess):[详细]

2023-02-26 05:20 分类：问答
How to implement the Sum of Subsets problem in Java

Does anyone know how to implement the Sum-of-Subsets problem in Java from this pseudo code? w = an array of positive integers sorted in non-decreasing order.[详细]

2023-02-23 08:28 分类：问答
Knapsack problem with specified number of weights can be used

I have a knapsack problem with specified knapsack capacity for weight and weights count. I need an algorithm that packs weights to knapsack when knapsack capacity is C, needed weights count is N and[详细]

2023-02-19 22:17 分类：问答
Solving a variation of 0/1 Knapsack (multiple source for items, each item can be selected from one of the sources)

So for a practice question, we are supposed to design a Dynamic Programming algorithm which is a variation of 0/1 knapsack problem... Basically each item comes from 4 different source, and that item c[详细]

2023-02-18 04:51 分类：问答
Recursive backtracking

I am having a problem with my backtracking function it loops with certain data I can\'t write here the whole program code but can put here my function.[详细]

2023-02-13 13:52 分类：问答
Knapsack 0-1 path reconstruction (which items to take) [duplicate]

This question already has answers here: 开发者_开发技巧 How to find which elements are in the bag, using Knapsack Algorithm [and not only the bag's value]?[详细]

2023-02-09 20:44 分类：问答
Why is the knapsack problem pseudo-polynomial?

I know that Knapsack is NP-complete while it can be solved by DP. They say that the DP solution is pseudo-polynomial, since it is exponential in the \"length of input\" (i.e.开发者_StackOverflow社区 t[详细]

2023-02-01 02:28 分类：问答
Packing problem revisited

I\'m developing a game and I found a problem that I have to solve to handle the layout of a component which resembles me a packing problem.[详细]

2023-01-31 19:11 分类：问答