One task of routing jobs in high radiation conditions

DOI10.35634/2226-3594-2021-58-06zbMath1489.90206OpenAlexW4200598507MaRDI QIDQ5067414

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

Publication date: 1 April 2022

Published in: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingdismantlingroute

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• The traveling salesman problem and its variations.
• To question of routing of works complexes
• About one route problem with interior works
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• On One Routing Problem with Non-Additive Cost Aggregation
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• An Algorithm for the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman

This page was built for publication: One task of routing jobs in high radiation conditions