Знаходження максимального потоку в мережі з додатковими комбінаторними обмеженнями

In article the task of a finding of the maximum flow in a network with additional combinatorial restrictions is delivered and solved. The mathematical model is constructed; the algorithm of its decision is stated. The considered task is generalization of the task of a finding of the maximum flow in a network.