document: Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method 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
doc_bio_tags: O O O B I I I O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O