Shortest path problems on stochastic graphs: a neuro dynamic programming approach.
Marco BagliettoGiorgio BattistelliFederico VitaliRiccardo ZoppoliPublished in: CDC (2003)
Keyphrases
- shortest path problem
- dynamic programming
- directed graph
- shortest path
- combinatorial optimization problems
- single source
- finding the shortest path
- interval data
- multiple objectives
- knapsack problem
- graph matching
- monte carlo
- weighted graph
- reinforcement learning
- neural network
- artificial neural networks
- linear programming
- greedy algorithm
- forward and backward
- graph structures
- stochastic model
- stereo matching
- directed acyclic graph
- optimal solution
- undirected graph
- random walk
- graph data
- graph structure
- multi objective
- dp matching
- locally optimal
- single machine
- optimal policy
- random graphs
- graph clustering
- lagrangian relaxation
- neuro fuzzy
- graph theoretic
- graph representation
- simulated annealing
- graph theory
- graph mining
- genetic programming