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, we need algorithm to
allocate in minimum number of cars.
On Oct 30, 10:26 am, Arunachalam <[EMAIL PROTECTED]> wrote:
> 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 to allocate the
> > riders in minimum number of cars.--
> ===================================
> want to know more about me
> http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
