Arriving-on-time problem: Discrete algorithm that ensures convergence

Keyphrases

• Time Problem 100%
• Stochastic on Time Arrival 100%
• Discrete Algorithm 100%
• Successive Approximation 66%
• Travel Time Reliability 66%
• Engineering Fields 33%
• Time Information 33%
• Travel Time 33%
• Performance Measures 33%
• Computational Efficiency 33%
• Stochastic Networks 33%
• Finite number 33%
• Stochastic Environment 33%
• Adaptation Strategies 33%
• Pathfinding 33%
• Numerical Examples 33%
• Polynomial Time 33%
• Conditional Value at Risk 33%
• Time Threshold 33%
• Optimal Path Algorithm 33%
• Chance Constraints 33%
• Reliability Value 33%

Computer Science

• Approximation (Algorithm) 100%
• Time Information 50%
• Algorithm Converges 50%
• Performance Measure 50%
• Scientific Field 50%
• Engineering Field 50%
• Path Algorithm 50%
• Reliability Value 50%
• Value at Risk 50%
• Computational Efficiency 50%
• Numerical Example 50%
• Polynomial Time 50%

Mathematics

• Stochastics 100%
• Arrival Time 75%
• Successive Approximation 50%
• Optimal Path 50%
• Open Question 25%
• Value at Risk 25%
• Stochastic Networks 25%
• Performance Measure 25%
• Numerical Example 25%
• Polynomial Time 25%
• Finite Number 25%