Graduate Students
Supervised
NAME |
PROGRAM |
YEARS |
TITLE OF RESEARCH |
Desjardins, Nicholas |
Masters (in progress) |
2015- |
To be determined |
Fu, Yao |
Masters |
2012-2014 |
Applications of circulations and removable pairings to TSP and 2ECSS |
Sun, Yu |
Masters |
2011- 2013 |
Theoretical and experimental studies on the minimum size 20edge connected spanning subgraph problem |
Haghighi, Maryam |
PhD |
2007-2011 |
A study of the median problem in genomics |
Cameron, Amy |
PhD |
2006-2012 |
Approximation algorithms for connectivity problems |
Elliott-Magwood, Paul |
PhD |
2003-2008 |
On the asymmetric TSP |
Patil, Geetha |
Masters |
2004-2005 |
Compatible tours for the asymmetric traveling salesman problem |
Benoit (formerly Labont), Genevive |
Masters |
2001-2003 |
A parallel computing method for efficient separation of inequalities |
He, Yong |
Masters |
2001-2002 |
Testing an iterative rounding technique for the survivable communication network problem |
Vella, Danielle |
Masters |
1997-2001 |
Using DP constraints to obtain improved solutions for the TSP |
Cockburn, Sally |
Masters |
1997-2000 |
The domino constraints for the travelling salesman problem |
Potter, Michael |
Masters |
1993-1998 |
A supply-demand problem with scheduling constraints |
Weedmark, Michael |
Masters |
1992-1994 |
Minimizing machine set-up time when manufacturing PCBs |
Weedmark, Mark |
Masters |
1992-1994 |
Optimizing PCB assembly times |
Perez, Maria |
Masters |
1992-1994 |
Synchronizable protocol test sequence generation |
Wu, Xiaolin |
Masters |
1992-1993 |
Designing communication networks |
Hao, Tianbao |
Masters |
1989-1991 |
An integer polytope related to the design of communication networks |
Postdoctoral Fellows Supervised
NAME |
YEARS |
TITLE OF RESEARCH |
Wang, Yu |
1997 |
The constraint-based Master Scheduling Problem |
Marcus, Karina |
1996-1997 |
Adding functionality to communication networks |
Carr, Bob |
1995-1996 |
Using relaxations for the TSP to obtain low cost solutions |
Zhang, Fan |
1993-1994 |
Necessary constraints for survivable communication networks |