-
November 16th, 2013, 02:59 AM
#1
Dynamic activity selection
I am having some problem with a variation of the activity selection problem. This is homework so I'm just looking for some help with the recursion. It is a weighted activity selection where each interval has a start and finish and profit. I need to find the max profit that can be achieved however the variation is that there has to be more "short" length intervals than "long". Where a short interval is considered to be less than 5 (from start to finish). I can solve the maximum profit problem but not sure how to handle the variation.
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|