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

By Yu (Marco) Nie, Yueyue Fan. 2006

76 citations recorded by the source corpus.

Subfields: Building and Construction, Control and Systems Engineering, Transportation

View Paper: https://www.semanticscholar.org/paper/b14456609724c8abfa26f99df7cd1f2cea60c1e1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Building and Construction

1. Xing Wu
2. Yu (Marco) Nie

In Control and Systems Engineering

1. Xing Wu
2. Yu (Marco) Nie

In Transportation

1. Xing Wu
2. Yu (Marco) Nie
3. Alejandro Tirachini
4. A. Gómez-Lobo

Citations in the corpus

• Shortest path problem considering on-time arrival probability (2009, methodology): “A discretized SOTA problem is studied in Fan and Nie (2006) and Nie and Fan (2006).”