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

•Algorithms for the probability maximizing shortest path problem are proposed.•Pseudo polynomially or polynomially solvable special cases are identified.•A novel fully polynomial time approximation scheme (is proposed). In this paper, we consider a probability maximizing shortest path problem. For a...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 300; no. 1; pp. 35 - 45
Main Authors:	Lee, Jisun, Joung, Seulgi, Lee, Kyungsik
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2022
Subjects:	Combinatorial optimization Exact algorithm Fully polynomial time approximation scheme Probability maximization Shortest path Shortest path Fully polynomial time approximation scheme Combinatorial optimization Exact algorithm Probability maximization
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!