An algorithm for reliable shortest path problem with travel time correlations

Keyphrases

• Average Travel Time 33%
• Computation Time 66%
• Convex Optimization Problem 33%
• Covariance Matrix 33%
• Covariance Matrix Decomposition 33%
• Decomposition Method 33%
• Deep-cut 33%
• Duality Gap 33%
• Eigenvalues 33%
• Ellipsoid 33%
• Ellipsoid Method 33%
• Gap Times 33%
• Lagrangian 33%
• Lagrangian multiplier 66%
• Lagrangian Relaxation 33%
• Large-scale Networks 66%
• Link Travel Time 33%
• Mean Standard Deviation 33%
• Mixed Integer Nonlinear Programming 33%
• Non-additivity 33%
• Nonlinearity 33%
• Numerical Experiments 33%
• One-based 33%
• Original Problem 33%
• Outer Approximation 33%
• Relaxation-based 33%
• Reliable Shortest Path 33%
• Reliable Shortest Path Problem 100%
• Shortest Path Algorithm 33%
• Shortest Path Problem 66%
• Subgradient 33%
• Subgradient Method 33%
• Substitution Matrix 33%
• Travel Time 33%
• Travel Time Correlation 100%
• Update Mechanism 33%
• Update Strategy 33%

Mathematics

• Approximation Method 20%
• Covariance Matrix 40%
• Duality Gap 20%
• Eigenvalue 20%
• Integer 20%
• Lagrangian 40%
• Lagrangian Multiplier 40%
• Linear Program 20%
• Matrix Decomposition 20%
• Nonlinear 20%
• Nonlinearity 20%
• Numerical Experiment 20%
• One-to-One 20%
• Path Problem 100%
• Standard Deviation 20%

Computer Science

• Approximation (Algorithm) 20%
• Computational Time 40%
• Convex Optimization 20%
• Covariance Matrix 40%
• Eigenvalue 20%
• Ellipsoid Method 20%
• Gradient Method 20%
• Lagrangian Multiplier 40%
• Lagrangian Relaxation 20%
• Linear Program 20%
• Optimization Problem 20%
• Shortest Path Algorithm 20%
• Shortest Path Problem 100%
• Speed-up 20%
• Substitution Matrix 20%