Abstract
The paper considers the bottleneck routing problem, the prototype of which is the task of minimizing the radiation dose of workers during the performance of work related to disassembly of radiation-hazardous equipment. The authors proposed an optimal algorithm for solving the problem, which is based on the dynamic programming method. Its effectiveness is illustrated by example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
