Applying Dijkstra's algorithm for general shortest path problem with normal probability distribution arc length

DOI10.1504/IJOR.2014.064541zbMath1326.90096WikidataQ56078222 ScholiaQ56078222MaRDI QIDQ2350527

Mohammad Hessam Olya

Publication date: 24 June 2015

Published in: International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingshortest pathconvolutionnormal distribution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Dynamic programming (90C39)

Related Items (1)

A fully polynomial time approximation scheme for the probability maximizing shortest path problem

This page was built for publication: Applying Dijkstra's algorithm for general shortest path problem with normal probability distribution arc length