Nsakanda A. L., Diaby M., Cao Y. L. (2010), “Solving capacitated part-routing problems with set-up times and costs: A Dantzig-Wolfe based solution approach”, International Transactions in Operational Research, 18, 71-86.
Nsakanda A. L., Diaby M., Price W.L. (2010), “A price-directed decomposition approach for solving large-scale capacitated part-routing problems”, International Journal of Production Research, 48(14), 4273-4295.
Cao Y., Nsakanda A.L., Diaby M. (2010), “Planning the Supply of Rewards in Loyalty Reward Programs- A Supply Chain Perspective”, Decision Science Institute Conference, San Diego (California), November 20-23.
Cao Y., Nsakanda A.L., Mann I. J. S. (2010), “A Typology Framework of Loyalty Reward Programs”, in Zaman M. et al. (Eds), Coomunication in Computer and Information System 113 – E-business Technology and Strategy, International Conference Proceedings, Ottawa, Canada, September 29-30, 159-170.
Cao Y., Nsakanda A.L., Diaby M. (2010), “Aggregate planning of rewards-supply in loyalty reward programs”, ASAC Conference, Regina (Saskatchewan), May 22-24.
Cao Y., Nsakanda A.L., Diaby M. (2010), “Coping with the Planning of Rewards Supply in Loyalty Reward Programs– A Mathematical Formulation Model”, POMS Conference, Vancouver (British Columbia), May 7-10.
Nsakanda A.L., M. Diaby and Y. Cao (2010), “A predictive model of redemption and liability in loyalty reward programs industry”. 43th Annual Hawaii International Conferences on System Sciences, Koloa, Hawaii, January 5-8.
Nsakanda A.L., M. Diaby and Y. Cao (2009), “Transportation problem-based heuristics for the set partitioning problem. A predictive model of redemption and liability in loyalty reward programs industry”. INFORMS Conference, San Diego, USA, October 11-14.
Cao Y. and A.L. Nsakanda (2009), “A typology framework of loyalty rewards programs”. CORS-INFORMS Conference, Toronto, Ontario, June 14-17.
Stevenson W.J., C. Ozgur and A.L. Nsakanda (2009), Introduction to management science with spreadsheets, 1st Canadian Edition. McGraw-Hill & Ryerson, 682 pages. (In Press)