Login / Signup
A fully polynomial time approximation scheme for the probability maximizing shortest path problem.
Jisun Lee
Seulgi Joung
Kyungsik Lee
Published in:
Eur. J. Oper. Res. (2022)
Keyphrases
</>
shortest path problem
shortest path
single source
interval data
combinatorial optimization problems
multiple objectives
bicriteria
directed graph
directed acyclic graph
bi objective
probability distribution
genetic algorithm
data streams
optimization problems
knapsack problem