Home/ Questions/Q 6113017
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-23T14:48:38+00:00

I would like to find an appropriate algorithm to solve this problem: Suppose we

  • 0

I would like to find an appropriate algorithm to solve this problem:

Suppose we have N projects and we know how much money we will earn by each project and how much time it is required for each project to be done(estimated time for each project). We have certain amount of available time to do all projects. We want to select projects so that our profit is maximized and overall estimated time does not exceed available time. Can you please advise which optimization algorithm should I use? Are there any already made things that I could use in C#, .NET technology or Java technology?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This sounds like straightforward Knapsack problem:

    Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.

    In your case, the weight is the time required for the projects, and the limit is the time limit.

    Normally, if you are doing this for the real world, then a brute-force would suffice for the small cases, and greedy approximation with some randomization should be good enough for the large cases if you don’t really care for the accurate maximal. However, I doubt if anyone would use such a strict model for the real world.

    In the case of theoretical interest, knapsack problem is NP-hard, and an active field of algorithm.

    • 0