NP-трудность комбинаторной задачи нахождения максимального потока

In article is proposed the maximum flow problem with additional combinatorial restrictions. This problem is generalization of the classical maximum flow problem. In article NP-hard of a problem is proved.