Source : Problem from tutorial sheet of ADA ( course at IITD in algorithm design )
Problem : We are given n1 objects of type 1 with size s1 each , n2 of type 2 with size s2 each & n3 of type 3 with size s3 each. We have a large supply of bins each of size S. Find the minimum number of bind needed to pack all the objects. ( Obvly , Objects are not to be cut in fractions )
First we choose the combination which is as nearer to 's' as possible but low and fill the bins until one of the type exhausts and repeat this untill all exhaust ..is this correct ???
ReplyDelete