Weighted Activity selection problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 11:0211:02, 10 October 2022‎ Admin talk contribs‎ 1,608 bytes +1,608‎ Created page with "== Problem Description== Let's consider that you have n activities with their start and finish times, the objective is to find solution set having maximum number of non-conflicting activities that can be executed in a single time frame, assuming that only one person or machine is available for execution. It might not be possible to complete all the activities, since their timings can collapse. Two activities, say i and j, are said to be non-conflicting if si >= fj or sj..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Weighted_Activity_selection_problem"