RO EN
Determining the Optimal Paths in Networks with Rated Transition Time Costs
Authors: Lozovanu Dmitrii
– 0.14 Mb
Abstract
We formulate and study the problem of determining the optimal paths in networks with rated transition time costs on edges. Polynomial time algorithms for determining the optimal solution of this problem are proposed and grounded. The proposed algorithms generalize algorithms for determining the optimal paths in the weighted directed graphs.Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD−2028
Moldova
E-mail:
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD−2028
Moldova
E-mail:
Fulltext
– 0.14 Mb
Contents
- On stability of multicriteria investment Boolean problem with Wald's efficiency criteria
- Determining the Optimal Paths in Networks with Rated Transition Time Costs
- A note on six-dimensional planar Hermitian submanifolds of Cayley algebra
- Estimation of the extreme survival probabilities from censored data
- Chebyshev-Grüss-type inequalities via discrete oscillations
- Closure operators in the categories of modules. Part III (Operations in CO and their properties)
- On the number of group topologies on countable groups
- Invariant transformations of loop transversals. 1a. The case of automorphism
