On computing complexity of the problem of search for a set on options in exchange of indivisible resources

The paper is concerned with search for an optimal set of options in exchange of indivisible resources which is a problem of optimal integer circulation in a network with gain in the arcs. The problem is shown to belong to the class of $NP$-difficult combinatorial problems. A procedure of reducing this problem to the well-known traveling salesman problem is described.