Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
-
Updated
May 28, 2017 - Java
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
The project implements a dynamic programming approach to solve the Weighted Interval Scheduling problem, efficiently finding the optimal set of non-overlapping jobs with maximum profit from a given set of intervals.
Dynamically programmed implementation of the weighted interval scheduling problem
Projects that are using Computer Algorithm
Add a description, image, and links to the weighted-interval-scheduling topic page so that developers can more easily learn about it.
To associate your repository with the weighted-interval-scheduling topic, visit your repo's landing page and select "manage topics."