| |
| 2009 | ||
|---|---|---|
| 7 | EE | Ann Melissa Campbell, Barrett W. Thomas: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers & OR 36(4): 1231-1248 (2009) |
| 2007 | ||
| 6 | EE | Leonora Bianchi, Ann Melissa Campbell: Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. European Journal of Operational Research 176(1): 131-144 (2007) |
| 5 | EE | Ann Melissa Campbell, Timothy J. Lowe, Li Zhang: The p. European Journal of Operational Research 176(2): 819-835 (2007) |
| 2006 | ||
| 4 | EE | Ann Melissa Campbell: The Vehicle Routing Problem with Demand Range. Annals OR 144(1): 99-110 (2006) |
| 3 | EE | Ann Melissa Campbell: Aggregation for the probabilistic traveling salesman problem. Computers & OR 33: 2703-2724 (2006) |
| 2 | EE | Ann Melissa Campbell, Timothy J. Lowe, Li Zhang: Upgrading arcs to minimize the maximum travel time in a network. Networks 47(2): 72-80 (2006) |
| 2005 | ||
| 1 | EE | Ann Melissa Campbell, Jill R. Hardin: Vehicle minimization for periodic deliveries. European Journal of Operational Research 165(3): 668-684 (2005) |
| 1 | Leonora Bianchi | [6] |
| 2 | Jill R. Hardin | [1] |
| 3 | Timothy J. Lowe | [2] [5] |
| 4 | Barrett W. Thomas | [7] |
| 5 | Li Zhang | [2] [5] |