Description: Arrangements to solve the problem. Equipped with N activities, in which each activity requires the use of the same kind of resource, and at the same time there is only one activity can use the resources, each activity has requires the use of the resource, start time and end time, if two activities using uniform resource time not conflict, so they said two activities are compatible. The problem is that how to determine the maximum compatibility subsets of a given activity concentration.
To Search:
File list (Check if you may need any files):
Download