On One Routing Problem with Non-Additive Cost Aggregation

DOI10.14529/MMP200105zbMath1451.90165OpenAlexW3023382961MaRDI QIDQ3387303

Alekseĭ Aleksandrovich Chentsov, A. N. Sesekin, A. G. Chentsov

Publication date: 12 January 2021

Published in: Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software" (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vyuru531

zbMATH Keywords

dynamic programmingroutepreceding conditions

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (3)

On sequential traversal of sets ⋮ One task of routing jobs in high radiation conditions ⋮ A bottleneck routing problem with a system of priority tasks

This page was built for publication: On One Routing Problem with Non-Additive Cost Aggregation