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

DOI10.20537/2226-3594-2017-50-08zbMATH Open1418.90278OpenAlexW2789947383MaRDI QIDQ4565259FDOQ4565259

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

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

zbMATH Keywords

dynamic programmingtraceroutepreceding conditions

Mathematics Subject Classification ID

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

Cites Work

• An Algorithm for the Traveling Salesman Problem
• Title not available (Why is that?)
• Route problem with constraints depending on a list of tasks
• Problem of successive megalopolis traversal with the precedence conditions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem and its variations.
• In pursuit of the traveling salesman. Mathematics at the limits of computation
• A generalized Courier problem with the cost function depending on the list of tasks
• The traveling salesman problem. II: Exact methods
• The traveling salesman problem. Approximate algorithms
• Routing under constraints: problem of visit to megalopolises
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints
• The Bellmann insertions in the route problem with constraints and complicated cost functions
• The Bellmann insertions in route problems with constraints and complicated cost functions. II

Cited In (6)

• OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS
• Optimizing multi-inserts in routing problems with constraints
• On One Routing Problem Oriented on the Problem of Dismantling Radiation-Hazardous Objects
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• One task of routing jobs in high radiation conditions
• On the question of the optimization of permutations in the problem with dynamic 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)