Give a backtracking algorithm to solve the assignment problem defined as follows.
Given n employees to be assigned to n jobs such that the cost of assigning the ith person to the jth job is ci,j,find an assignment that minimizes the total cost.Assume that the cost is nonnegative,that is, c>=0 for 1<=i,j<=n.
请给出程序,满意加10分,
谢谢!
再追加10分