title: Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
abstract: A class of Euclidean combinatorial optimization problems is selected that can be solved by the dynamic programming method. The problem of allocation of servicing enterprises is solved as an example
keyphrases: Euclidean combinatorial optimization problem dynamic programming method