Dan Rinks

According to our database, Dan Rinks authored at least 2 papers between 1997 and 2001.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2001

The first <i>K</i> minimum cost paths in a time-schedule network.

Yen-Liang Chen, Dan Rinks, Kwei Tang

J. Oper. Res. Soc., 2001

1997

Critical path in an activity network with time constraints.

Yen-Liang Chen, Dan Rinks, Kwei Tang

Eur. J. Oper. Res., 1997