Raymond K.-M. Cheung

According to our database, Raymond K.-M. Cheung authored at least 6 papers between 1994 and 2000.

Collaborative distances:

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

2000

Adaptive Labeling Algorithms for the Dynamic Assignment Problem.

Warren B. Powell, Wayne Snow, Raymond K.-M. Cheung

Transp. Sci., 2000

Shape - a Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs.

Raymond K.-M. Cheung, Warren B. Powell

Oper. Res., 2000

1996

Models and Algorithms for Distribution Problems with Uncertain Demands.

Raymond K.-M. Cheung, Warren B. Powell

Transp. Sci., 1996

An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management.

Raymond K.-M. Cheung, Warren B. Powell

Oper. Res., 1996

1994

A network recourse decomposition method for dynamic networks with random arc capacities.

Warren B. Powell, Raymond K.-M. Cheung

Networks, 1994

Stochastic programs over trees with random arc capacities.

Warren B. Powell, Raymond K.-M. Cheung

Networks, 1994