Description: The activities of the organization of a need to use the n-a resource composed of a collection of activities S = (1, 2, ..., n), the resources can only be occupied by an activity. Each time i have to start s [i] and end times f [i], and s [i] <= f [i]. Once selected, activity i will occupy half-open time interval [s [i], f [i]). If [s [i], f [j]) and [s [i], f [j]) do not overlap each other, said the activities of i and j are compatible. Activities is to choose a compatible issue of the composition of the largest collections.
To Search:
File list (Check if you may need any files):
Download