Description: Task allocation problem Problem Description: the N tasks assigned to the n individuals, the cost of task j allocation gives i C [I, J] want to complete all the tasks of the lowest cost, the algorithm is how to design? Programming task: given task the following table, programming required to complete the task the lowest cost. Data input: your own definition. Output: the end of the run, the calculation results output to the file output.txt.
To Search:
File list (Check if you may need any files):
1.cpp