Question: Problem: MULTIPLE KNAPSACK: Given n objects, each with a value v i and a weight w i , and k knapsacks, each with capacity C

Problem: MULTIPLE KNAPSACK: Given n objects, each with a value v_i and a weight w_i, and k knapsacks, each with capacity C, assign objects to the knapsacks so that the total weight of the objects in each does not exceed C and the total value of all the selected objects is maximized.

Can anyone give a program in c++, java or python design that implement a simple heursistic to solve this problem, an example of a simple heursist is a greedy aglorthim.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Problem: MULTIPLE KNAPSACK: Given n objects, each with a value vi and a weight wi, and k knapsacks, each with capacity C, assign objects to the knapsacks so that the total weight of the objects in...

write a program in c++, java, python that uses a greedy heuristic to solve the problem. Problem: MULTIPLE KNAPSACK: Given n objects, each with a value vi and a weight wi, and k knapsacks, each with...

Problem 3 (10 points) The Knapsack decision problem has the following description: Input: N objects each with a value V; and a weight W; and two numbers W and V. All numbers are integers. Output:...

please solve this question Problem 3 (10 points) The Knapsack decision problem has the following description: Input: N objects each with a value v; and a weight w; and two numbers W and V. All...

. The Knapsack decision problem has the following description: Input: N objects each with a value V; and a weight w; and two numbers Wand V. All numbers are integers. Output: YES/NO, depending on...

We consider the integral (or 0/1) knapsack problem which is a modication of the fractional knapsack problem considered in Chapter 7. The problemisdenedasfollows. Problem6.1(0/1 Knapsack). We are...

In class, we studied the fractional [0, 1]-knapsack problem using a greedy approach. In this assignment, we work on the {0, 1}-knapsack problem using dynamic programming. You are given n objects...

Please only answer if you are 100% sure of what you are doing. Dynamic programming algorithms and optimal solution. 1) Using Dynamic Programming You are given n objects which cannot be broken into...

Supply Club, Inc., sells a variety of paper products, office supplies, and other products used by businesses and individual consumers. During July 2021 it started a loyalty program through which...

What should be done to create a torque without any slip? Explain.

Each year in office until his retirement in 2 0 1 7 , U . S . congressman John Conyers introduced a bill to study the issue of _ _ _ _ _ _ _ _ _ _ . His attempts to create a commission to assess the...

On 1 March 2007 DB Limited issued R560 000 15% debentures at R98. The debentures were to be redeemed at par in four equal annual payments starting 28 February 2010. Required: Journalise the above...