Is this problem a knapsack problem?

A question related to 'KNAPSACK PROBLEM' (many thanks)?

  • Three types of parcels, called A, B and C, must be packed into the hold of an aeroplane, which has the capacity of 8m3. The volume and value of each type of parcel is ... Parcel type =A, volume(m3)=6, value(£)27 Parcel type =B, volume(m3)=4, value(£)17 Parcel type =C, volume(m3)=3, value(£)10 Solve the problem by dynamic programming, tabulating the trial values and optimal values of all states and showing clearly how the optimal solution is obtained from the values given.

  • Answer:

    The greatest mystery here is "WHAT IS THE PROBLEM TO BE SOLVED?" If a knowledge of the 'knapsack' problem is required, please copy it here for all to ponder............

wm at Yahoo! Answers Visit the source

Was this solution helpful to you?

Other answers

ok what??

squirrely

Related Q & A:

Just Added Q & A:

Find solution

For every problem there is a solution! Proved by Solucija.

  • Got an issue and looking for advice?

  • Ask Solucija to search every corner of the Web for help.

  • Get workable solutions and helpful tips in a moment.

Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.