A simple efficient approximation scheme for the restricted shortest path problem.
Dean H. LorenzDanny RazPublished in: Oper. Res. Lett. (2001)
Keyphrases
- shortest path problem
- shortest path
- single source
- interval data
- efficient computation
- polynomial approximation
- combinatorial optimization problems
- error bounds
- directed graph
- closed form
- bi objective
- evolutionary algorithm
- approximation error
- bayesian networks
- polynomial time approximation
- provably secure
- neural network