2004 | ||
---|---|---|
9 | EE | Wen Lea Pearn, Ying Chung Chang: Optimal management of the N-policy M/Ek/1 queuing system with a removable service station: a sensitivity investigation. Computers & OR 31(7): 1001-1015 (2004) |
1999 | ||
8 | EE | Wen Lea Pearn, J. B. Chou: Improved solutions for the Chinese postman problem on mixed networks. Computers & OR 26(8): 819-827 (1999) |
1998 | ||
7 | EE | Wen Lea Pearn, R. C. Chien: Improved solutions for the traveling purchaser problem. Computers & OR 25(11): 879-885 (1998) |
1995 | ||
6 | EE | Wen Lea Pearn, C. M. Liu: Algorithms for the Chinese postman problem on mixed networks. Computers & OR 22(5): 479-489 (1995) |
5 | EE | Wen Lea Pearn, T. C. Wu: Algorithms for the rural postman problem. Computers & OR 22(8): 819-828 (1995) |
1994 | ||
4 | EE | Wen Lea Pearn, Mao Lin Li: Algorithms for the Windy Postman Problem. Computers & OR 21(6): 641-651 (1994) |
1991 | ||
3 | EE | Wen Lea Pearn: Augment-insert algorithms for the capacitated arc routing problem. Computers & OR 18(2): 189-198 (1991) |
1989 | ||
2 | EE | Wen Lea Pearn: Approximate solutions for the capacitated arc routing problem. Computers & OR 16(6): 589-600 (1989) |
1987 | ||
1 | EE | Wen Lea Pearn, Arjang A. Assad, Bruce L. Golden: Transforming arc routing into node routing problems. Computers & OR 14(4): 285-288 (1987) |
1 | Arjang A. Assad | [1] |
2 | Ying Chung Chang | [9] |
3 | R. C. Chien | [7] |
4 | J. B. Chou | [8] |
5 | Bruce L. Golden | [1] |
6 | Mao Lin Li | [4] |
7 | C. M. Liu | [6] |
8 | T. C. Wu | [5] |