The Bellmann insertions in route problems with constraints and complicated cost functions. II

DOI10.20537/VM160410zbMath1382.90009OpenAlexW4255604921MaRDI QIDQ5364324

A. G. Chentsov

Publication date: 4 October 2017

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20537/vm160410

zbMATH Keywords

dynamic programminginsertionroute

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (4)

A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ On the question of the optimization of permutations in the problem with dynamic constraints ⋮ Optimizing insertions in a constraint routing problem with complicated cost functions

This page was built for publication: The Bellmann insertions in route problems with constraints and complicated cost functions. II