Dynamic programming in multi-level routing problems with constraints

DOI10.35634/2226-3594-2026-67-08MaRDI QIDQ7310856zbMATH OpenFDO

Authors A. G. Chentsov, P. A. Chentsov

Publication date 6 August 2026

Published in Izvestiya Instituta Matematiki i Informatiki. Udmurtskiĭ Gosudarstvennyĭ Universitet (Search for Journal in Brave)

Full work available at URL https://doi.org/10.35634/2226-3594-2026-67-08

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• An Algorithm for the Traveling Salesman Problem
• Dynamic programming and decomposition in extreme routing problems
• Dynamic programming in the routing problem: decomposition variant
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3400017 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Multi-level dynamic programming in routing problems with constraints
• On one routing problem modeling movement in radiation fields
• The traveling salesman problem and its variations.
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• Two-stage dynamic programming in the routing problem with decomposition

This page was built for publication: Dynamic programming in multi-level routing problems with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310856)