Mathematical models and algorithms for operational control of mail and cargo traffic in postal network

Mathematical models and algorithms for operational control of mail and cargo traffic in postal network in the form of large problems of linear Boolean programming are proposed. The properties of these problems are examined, accurate and rough estimates of the value of the optimality criterion at different stages of the solution are given, operators of selection of areas that do not contain feasible solutions are given. The process of obtaining the exact and approximate solutions is presented in the form of an iterative process of solving the two substantially smaller and simpler tasks. The algorithms for solving the problem with use of modified branch and bound algorithm taking into account the specific peculiarities of the general problem are described.