Use Knap sack algorithm i think its best for this kind of problems
search on google :)
On 10/30/06, Joe <[EMAIL PROTECTED]> wrote:
Give an Optimal Allocation Algorithm for the described problem:Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0<=M
There are 'n' persons.
A car can carry maximum of weight 'M'
For example: Q = {10,45,30,60,5,20,15,10}
We need to allocate them in minimum number of cars.
Following is one allocation:
Taking, M = 75
C1 = {10,45}
C2 = {30}
C3 = {60,5}
C4 = {20,15,10}
but this doesn't uses minimum number of cars
Can you put some more light on the problem by giving some more examples ?
On 10/30/06, Joe <[EMAIL PROTECTED]> wrote:
Give an Optimal Allocation Algorithm for the described problem:Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0<=M weight. Algorithm
Give an Optimal Allocation Algorithm for the described problem:
Given 'n' riders of varying weight, they should be allocated to cars
and a car can be allocated 0<=M weight. Algorithm to allocate the
riders in minimum number of cars.
--~--~-~--~~~---~--~~
You rece
