2008 |
8 | EE | W. Matthew Carlyle,
Johannes O. Royset,
R. Kevin Wood:
Lagrangian relaxation and enumeration for solving constrained shortest-path problems.
Networks 52(4): 256-270 (2008) |
2006 |
7 | EE | Susan M. Sanchez,
R. Kevin Wood:
The "BEST" algorithm for solving stochastic mixed integer programs.
Winter Simulation Conference 2006: 765-773 |
6 | EE | Eduardo F. Silva,
R. Kevin Wood:
Solving a class of stochastic mixed-integer programs with branch and price.
Math. Program. 108(2-3): 395-418 (2006) |
2005 |
5 | EE | W. Matthew Carlyle,
R. Kevin Wood:
Near-shortest and K-shortest simple paths.
Networks 46(2): 98-109 (2005) |
2002 |
4 | EE | Eitan Israeli,
R. Kevin Wood:
Shortest-path network interdiction.
Networks 40(2): 97-111 (2002) |
1999 |
3 | EE | Wai-Kei Mak,
David P. Morton,
R. Kevin Wood:
Monte Carlo bounding techniques for determining solution quality in stochastic programs.
Oper. Res. Lett. 24(1-2): 47-56 (1999) |
1996 |
2 | | Appajosyula Satyanarayana,
R. Kevin Wood,
L. Camarinopoulos,
G. Pampoukis:
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network".
SIAM J. Comput. 25(2): 290 (1996) |
1985 |
1 | | Appajosyula Satyanarayana,
R. Kevin Wood:
A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks.
SIAM J. Comput. 14(4): 818-832 (1985) |