摘要：Here is set the algorithm, which reasonably solves Veber problem for n-sequentially connected chain and finite set of points of location. Сomparison of action period of a given algorithm and a model of integer linear programming, which was realized in IBM ILOG CPLEX, is carried out.
