Currently working on a problem, which I believe can be solved with some form of assignment algorithm. I have a set of resources and requirements, where each requirement has some combinatoric requirement of resources to be met. The objective is to try and optimize how many tasks are met, with unmet tasks being as close as possible.
For example, a task may be satisfied if it has resource A, or resource B and resource C. Another may require resource A and D. Thus, given resources A-D, the ideal assignment is B,C to task one and A,D to task two.
I think the best path to approach this is through some sort of bipartite assignment, or to potentially expand this to a multi level graph to better modal the combinatoric relationship and utilize some form of max-flow approach.
Any insight or direction to similar problems or solutions would be greatly appreciated.
Thanks