Abstract
We consider a routing problem with constraints. To solve this problem, we employ a variant of the dynamic programming method, where the significant part (that is, the part that matters in view of precedence constraints) of the Bellman function is calculated by means of an independent calculations scheme. We propose a parallel implementation of the algorithm for a supercomputer, where the construction of position space layers for the hypothetical processors is conducted with use of discrete dynamic systems’ apparatus.
Author supplied keywords
Cite
CITATION STYLE
Chentsov, A. G., & Grigoryev, A. M. (2016). A scheme of independent calculations in a precedence constrained routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9869 LNCS, pp. 121–135). Springer Verlag. https://doi.org/10.1007/978-3-319-44914-2_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
