Showing 41 - 50 of 802
Online activity increasing spreads with the power of technological development. Many studies reported the impact of online activities on decision making. From the statistical perspective, decision making is related to statistical inference. In this regard, it is interesting to propose a new...
Persistent link: https://www.econbiz.de/10013363072
Persistent link: https://www.econbiz.de/10014581325
This paper describes a simulation procedure for estimating the distribution function of the shortest path length in a network with random arc lengths. The method extends the concept of conditional Monte Carlo utilizing special properties of the Uniformly Directed Cutsets and the unique arcs. The...
Persistent link: https://www.econbiz.de/10009203881
It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are examined. Of particular interest is the dynamic topology that the flow networks exhibit. We develop a...
Persistent link: https://www.econbiz.de/10009204526
Приведен алгоритм поиска оптимального пути на графе с переменными весами. Рассмотрены формулы построения двумерных кубических сплайнов дефекта 1 и их вывод.
Persistent link: https://www.econbiz.de/10011226875
Persistent link: https://www.econbiz.de/10008615280
A deterministic method was developed in finding the best evolution path through which a country’s particular export industry will evolve into another export industry. The problem was framed as a shortest-path problem particularly known in graph theory literature. A concept on a typical...
Persistent link: https://www.econbiz.de/10008677451
For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional~A* that is considered the most appropriate in literature hitherto, uses...
Persistent link: https://www.econbiz.de/10010731649
For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. %This algorithm distinguishes between the main phase and the postprocessing phase. %As long as the search...
Persistent link: https://www.econbiz.de/10010731733
The aim of this research is to identify the relationship between activity patterns and route choice decisions. The focus is twofold: on the one hand, the relationship between the purpose of a trip and the road categories used for the relocation is investigated; on the other hand, the relationship...
Persistent link: https://www.econbiz.de/10010865564