One task of routing jobs in high radiation conditions

DOI10.35634/2226-3594-2021-58-06MaRDI QIDQ5067414zbMATH OpenOpenAlexFDO

Authors A. G. Chentsov, A. A. 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

dismantlingdynamic programmingroute

Mathematics Subject Classification ID

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

Recommendations

• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• On one routing problem modeling movement in radiation fields
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• Solving a routing problem with the aid of an independent computations scheme

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• A parallel procedure of constructing Bellman function in the generalized courier problem with interior works
• About one route problem with interior works
• An Algorithm for the Traveling Salesman Problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• 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 3324725 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• On One Routing Problem with Non-Additive Cost Aggregation
• 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.
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• To question of routing of works complexes

Cited in

(6)

• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• scientific article; zbMATH DE number 3959119 (Why is no real title available?)
• A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
• On one routing problem modeling movement in radiation fields
• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• Dynamic programming and decomposition in extreme routing problems

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

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