A Fully Polynomial Time Approximation Scheme for Fixed-Horizon Constrained Stochastic Shortest Path Problem under Local Transitions.

Published in: CoRR (2022)

Keyphrases

shortest path problem
shortest path
single source
interval data
combinatorial optimization problems
approximation schemes
state transition
directed graph
directed acyclic graph
bi objective
multiple objectives
stochastic model
genetic algorithm
knapsack problem
fixed number