Hacker News new | past | comments | ask | show | jobs | submit login

Probably you would model it as a mixed integer optimization task, and optimize for max % competence across picked duets.

Not terribly dissimilar from a traveling salesman problem where you pick the order of nodes traveled between to minimize distance.

Note that the graph coloring described here is a way of defining what the possible nodes and edges are in the duet example. You still need to do some sort of solving on to find a feasible solution within the graph, which would likely also involve the same logic I mentioned above.

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact