Algorithm of branches and boundaries for the task of forming a team and investors searching for startup projects

The task of forming a team for a startup project is considered. A mathematical model of the problem of determining candidates for the project team has been constructed. The candidates must have the most experience and require the least salary. The problem is reduced to the task of the backpack. A method is described and the expediency of using the algorithm of branches and boundaries for solving the problem is justified.