Abstract— This paper considers investing funds problem for the implementation of interrelated projects and jobs of a complex project or scientific-technical program in the case of insufficient funding. It is necessary to exclude the part of the projects from the program in this case. The paper proposes algorithms for selecting the optimal set of priority projects in funding at network structures. Keywords— resource allocation, discrete optimization, knapsack problem, network structure of projects