On one routing problem modeling movement in radiation fields

DOI10.20537/vm170405zbMath1401.90251OpenAlexW2790105200MaRDI QIDQ4961696

A. G. Chentsov, Alekseĭ Aleksandrovich Chentsov, Alekseĭ Mikhaĭlovich Grigor'Ev

Publication date: 25 October 2018

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingparallel computationprecedence constraintsroute

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS

Cites Work

• Route problem with constraints depending on a list of tasks
• Routing under constraints: problem of visit to megalopolises
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. I: Theoretical issues
• The traveling salesman problem. II: Exact methods
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• Hybrid optimization methods for time-dependent sequencing problems
• On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
• The traveling salesman problem and its variations.
• To question of routing of works complexes
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• An Algorithm for the Traveling Salesman Problem
• In Pursuit of the Traveling Salesman
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On one routing problem modeling movement in radiation fields