Graph Embedding and Approximate Dynamic Programming for the Reliable Shortest Path Problem.
Qihang PengHongliang GuoChuan HuPublished in: ITSC (2021)
Keyphrases
- shortest path problem
- approximate dynamic programming
- graph embedding
- shortest path
- linear program
- discriminant analysis
- dynamic programming
- combinatorial optimization problems
- low dimensional
- reinforcement learning
- dimensionality reduction
- semi supervised
- data representation
- directed graph
- step size
- multiple objectives
- dictionary learning
- subspace learning
- directed acyclic graph
- linear programming
- feature representation
- label information
- pattern recognition
- supervised learning
- combinatorial optimization
- probabilistic model
- machine learning