Boliac R., Leconiuc A., Lozovanu Dmitrii
We study some problems of finding optimal paths in dynamic networks, which generalise the well-known combinatorial problems on the shortest and on the longest paths in a weighted directed graph and which arose as auxiliary when solving some problems of discrete optimal control. Some results are brought here, on which basis polynomial algorithms for solving these problems were proposed.
Institutul de Matematică şi Informatică
Academia de Ştiinţe a Moldovei
str. Academiei 5, MD-2028 Chişinău, Moldova