Donglei Du
DONGLEI DU, Professor in Operations Research, joined
the Faculty of Business Administration in 2003 and is a member of the
Quantitative Methods Area. He teaches Business Statistics, Management
Science and Supply Chain Management in the BBA program, and Business
Data Analysis, and Production/Operations Management in the MBA program. In 2004-2005 he was the first recipient of the Faculty's Annual Research Award for outstanding research performance during that year. He also received the Merit Award of the University of New Brunswick during 2005-2006, the Faculty of Business Administration Excellence in Research Award (2007-2008), and he won the IEEM2007 Outstanding Paper Award at the International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore (December 2-5, 2007).
Donglei previously held a position at the Institute of Applied Mathematics in the Chinese Academy of Sciences.
His main research interests are Combinatorial Optimization, Network Flow, Scheduling, Approximation/Online/Randomized Algorithms, Supply Chain Management, Computational Game Theory, Robust Optimization and its Application in Financial Problems.
Besides his theoretical interests, Donglei is also involved in a number of practical projects which utilize his optimization and statistical techniques, such as the design of the Scheduling and Dispatching System for Day & Ross during 2004-2006.
Discipline-Based Scholarship
Selected d Journal Articles
D. Du, R. Lu, and D. Xu (2011). Primal-dual approximation algorithm for the facility location problem with submodular penalties, to appear in Algorithmica.
Z. Wang, D. Du, A.F. Gabor, D. Xu (2010). An approximation algorithm for the k-level stochastic facility location problem. Oper. Res. Lett.; 38(5), 386-389.
D. Du, X. Wang, D. Xu (2010). An approximation algorithm for the k-level capacitated facility location problem. J. Comb. Optim.; 20(4), 361-368.
Q. Han, D. Du, J.C. Vera and L.F. Zuluaga (2007). Improved bounds for the symmetric rendezvous value problem on the line, Operations Research 56(3) (2008) 772-782. (A preliminary version of the paper appears in the Proceedings of the 18th annual ACM-SIAM symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, 69-78.
S.N. Kabadi, J. Yan, D. Du and K.P.K. Nair (2008). Integer exact network synthesis problem. SIAM Journal on Discrete Mathematics; 23(1), 136-154.
L.F. Zuluaga, J. Pena and D. Du (2009). Extensions of Lo's semiparametric bound for European call options. European Journal of Operational Research; 198(2), 557-570.
D. Du and R. Chandrasekaran (2007). The maximum residual flow problem: NP-hardness with two-arc destruction. Networks; 50(3), 181-182.
S.N. Kabadi and D.Du (2007). Online network synthesis, Algorithmic Operations Research; 2(1) 65-74.
X. Jiang, D. Du and T.G. Ray (2007). On Optimality of one-bug-look-ahead policies for a software testing model. Naval Research Logistics Quarterly; 54(3), 346-355.
D. Du and R. Chandrasekran (2006). Multiroute maximum flow revisited. Networks; 47(2), 81-92.
D. Du and S.N. Kabadi (2006). An improved algorithm for decomposing arc-flows into multi-path flows. Operations Research Letters; 34(1), 53-57.
Z. Xia, I-L. Yen, D. Du and P. Li (2006). An integrated admission control scheme for the delivery of streaming media. Journal of Parallel and Distributed Computing; 66, 334-344.
Research Grants
(2009-2014) Combinatorial optimization with incomplete information: robust optimization and online computation. National Science and Engineering Research Council of Canada (NSERC) Discovery Grant Program (Individual): $120,000 ($26,000 per year).
(2005-2009) Multi-route Flow and On-line Scheduling Problems. National Science and Engineering Research Council of Canada (NSErC) Discovery Grant Program (Individual) $85,000 ($17,000 per year).
Contract Grants
(2004-2006) Day & Ross Project, $164,600.
Contact Information
Professor, Quantitative Methods
Coordinator, Quantitative Methods Area
Ph.D., University of Texas, Dallas
Office Phone: (506) 458-7353
Office Location 324 Tilley Hall
