Assign(dp+bitmask)

Revision en1, by razor123, 2017-05-20 14:27:25

Hi, most of us are aware of a classical assignment problem. It involves use of dp+ bitmasking. Now if the number of subjects increased to 80(instead of 10 which was equal to number of students) such that the number of students =10 and no of subjects =80. Can anyone help me in coming up with a bottom up solution?

Tags dynamic programming, bitmasking

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English razor123 2017-05-20 14:28:12 0 (published)
en1 English razor123 2017-05-20 14:27:25 371 Initial revision (saved to drafts)