Given a cost matrix with N columns and M rows such that M>=N, find the K lowest total cost ways to select one item from each column, with the restriction that only one item may be selected from any row.
Don -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
