0

I have a problem that should be solved with branch and bound algorithm, however i'm having a hard time thinking how to solve it. I'cant figure out how to start the branch and bound algorithm.

Here is the problem:

A car has a maximum weight and volume capacity, and i need to fill the car with packages. Those packages have a determined value of importance, weight and volume. The objective is to put in the car the combination of packages with highest importace value without passing the limits of weight and volume of the car.

rpax
  • 4,468
  • 7
  • 33
  • 57
jmca
  • 3
  • 2
  • 2
    What did you do so far? And what is your question? – Howard Mar 08 '11 at 19:28
  • You need to be more specific and show us that you have at least made an attempt to solve this problem. For example, what don't you understand about the branch and bound algorithm and its application to your problem? Stackoverflow isn't a place that will do your homework for you. – GWW Mar 08 '11 at 19:33

1 Answers1

0

For branch and bound you need to know how to describe a partial solution, and how to work out a bound on how good it could possibly be. A partial solution could be a list of packages that you have decided will definitely go in the car, regardless of what else you add. You can work out an upper bound on how much value will go in the car by looking to see how much space and weight is left, and, amongst the packages that are left, what the largest amount of value per unit volume and value per unit weight are.

mcdowella
  • 19,301
  • 2
  • 19
  • 25