A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)

DOI10.20537/2226-3594-2017-50-08MaRDI QIDQ4565259zbMATH OpenOpenAlexFDO

Authors

Publication date 8 June 2018

Published in Izvestiya Instituta Matematiki i Informatiki. Udmurt. Gos. Univ. (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10995/73716

zbMATH Keywords

dynamic programmingpreceding conditionsroutetrace

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Dynamic programming (90C39)

Recommendations

• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• One task of routing jobs in high radiation conditions
• On one routing problem modeling movement in radiation fields
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• Optimizing multi-inserts in routing problems with constraints

Cites work

• A generalized Courier problem with the cost function depending on the list of tasks
• An Algorithm for the Traveling Salesman Problem
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• scientific article; zbMATH DE number 3198203 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• Problem of successive megalopolis traversal with the precedence conditions
• Route problem with constraints depending on a list of tasks
• Routing under constraints: problem of visit to megalopolises
• The Bellmann insertions in route problems with constraints and complicated cost functions. II
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• 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

Cited in

(8)

• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• One task of routing jobs in high radiation conditions
• Optimizing multi-inserts in routing problems with constraints
• On the question of the optimization of permutations in the problem with dynamic constraints
• Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
• Dynamic programming and decomposition in extreme routing problems
• Dynamic programming in multi-level routing problems with constraints

This page was built for publication: A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)

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