On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks

Original language	English
Pages (from-to)	S67-S80
Number of pages	14
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	315
Issue number	SUPPL 1
DOIs	https://doi.org/10.1134/S0081543821060067
Publication status	Published - Dec 2021

Bellman function, dynamic programming, route, TRAVELING SALESMAN PROBLEM, TOOL PATH PROBLEM, OPTIMIZATION, MODEL

ID: 29476017