On filling in the vertices of an oriented graph

Abstract

On filling in the vertices of an oriented graph

Orlov V.V.

Incoming article date: 07.12.2017

The problem of filling vertices of an oriented graph is considered. It is assumed that the choice of vertices from which the filling will be made and their number are determined by us. The filling process is assumed to be discrete. The capacity of arcs and the capacity of vertices are integers. In this formulation, the problem can be considered as a model for the consideration of irrigation in closed irrigation networks, the delivery of goods through the network.

Keywords: oriented graph, irrigation system, graph capacity, logistic system, delivery of goods, filling of verti-ces of an oriented graph, network methods, transport task