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 weight. Algorithm to allocate the
riders in minimum number of cars.
--
••::aLi WajdaN::••
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
