tpng

Yash Aneja

Professor
Area Chair, Management Science

Office: Odette Building, Room 408
Phone: 519-253-3000, ext 3110
E-mail: aneja@uwindsor.ca

Education:
B. Stat. and M. Stat. (Indian Statistical Institute)
PhD (The Johns Hopkins University)

Research Interests:
Network Flows, Transportation Networks Design, WDM Networks, Sensor Networks, Integer Programming, Combinatorial Optimization.

Teaching Experience:
Business Data Analysis, Quantitative methods in management.

Journal Publications:
1. A. Jaekel, A. Bari, Q. Rahman, Y. Chen, S. Bandyopadhyay and Y. P. Aneja, Resource Efficient Network Design and Traffic Grooming Strategy with Guaranteed Survivability, Optical Switching and Networking, 9, 271-285, 2012.

2. Yogesh Agarwal and Y. P. Aneja. Fixed Charge Transportation Problem: Facets of the Projection Polytope, Operations Research, 60, 638-654, 2012.

3. Xiangyong Li and Y. P. Aneja, A Branch-and-Cut approach for the minimum energy broadcasting problem in wireless networks, INFORMS Journal on Computing, 24, 443-456, 2012.

4. Xiangyong Li, Y. P. Aneja and Jiazhen Huo, A robust branch-and-cut approach for the minimum-energy symmetric network problem, Omega, 40, 210-217, 2012.

5. Xiangyong Li, Y. P. Aneja and Jiazhen Huo, Using branch-and-price approach to solve the directed network design problem with relays, Omega, 40, 672-679, 2012.

6. Xiangyong Li, F. Baki, and Y. P. Aneja, Flow shop scheduling to minimize the total completion time with a permanent present operator, Computers and Operations Research, 38, 152-164, 2011.

7. Turner, Lara, Abraham Punnen, Y. P. Aneja,  Horst Hamacher,  On Generalized Balanced Optimization Problem, Mathematical Methods of Operations Research, 73, 19-27, 2011.

8. Q. Rahman, S. Bandyopadhyay, A. Jaekel and Y. P. Aneja and K. P. K. Nair, Path Protection in Translucent Optical Networks, Lecture Notes in Computer Science, 5935, 392-403, 2010.

9. Y. P. Aneja, R. Chandrasekaran, X. Li and K. P. K. Nair,  A Branch-and-Cut approach for the strong minimum energy topology in wireless networks, European Journal of Operational Research, 204, 604-612, 2010.

10. Xiangyong Li, F. Baki, and Y. P. Aneja, An ant colony optimization for machine-part cell formation problem, Computers and Operations Research, 37, 2071-2081, 2010.

11. Xiangyong Li, Y. P. Aneja and F. Baki, An ant colony optimization meta-heuristic for single path Multicommodity flow problems, Journal of the Operational Research Society (JORS), 61, 1340-1355, 2010.

12. A. Jaekel, S. Bandyopadhyay and Y. P. Aneja, “A New Approach for designing fault tolerant networks,” Computer Networks, 52, 3421-3432, 2008.

13. Y. P. Aneja, R. Chandrasekaran, S.N. Kabadi, and K. P. K. Nair, Flows over Edge-Disjoint Mixed Multi-paths and Applications, Discrete Applied Mathematics, 155, 1979-2000, 2007.

14. Y. P. Aneja, A. Jaekel and S. Bandyopadhyay, Some Studies on Path Protection in WDM Networks, Photonic Network Communication, 14, 165-176, 2007.

15. Y. P. Aneja and X. Ke, Multicommodity Disconnecting Set Problem, International Journal of Operations Research, Special Issue on Integer Programming, 4, 165-171, 2007.

16. Y. P. Aneja, S. Bandyopadhyay, A. Jaekel, On Routing in Large WDM Networks, Optical Switching and Networking, 3, 219-232 2006.

17.  Y. P. Aneja, Sokkalingam, P. T., The Minimal Feedback Arc Set Problem, INFORS: Graphs, Networks and Integer Programming, 42, 107-112, 2004.

18. Chandrasekaran, R., Nair, K.P.K., Y. P. Aneja, Kabadi, S.N., Multi-terminal multipath flows: synthesis, Discrete Applied Mathematics, 143, 182-193, 2004.

19. Punnen, A., Y. P. Aneja, Lexicographic Balanced Optimization Problem and Extensions, Operations Research Letters, 32, 27-30, 2004.

20. Y. P. Aneja, Chandrasekaran, R., Nair, K. P. K., Minimum cost system reliability with discrete choice sets for components, IEEE Transactions on Reliability, 53, 1-7, 2004.

21. Y. P. Aneja, Chandrasekaran, R. Nair, K. P. K., Parametric Analysis of Overall Mincuts and Applications in Undirected Networks,  Information Processing  Letters, 185, pp 105-109, 2003.

22. Y. P. Aneja, Chandrasekaran, R., Nair, K. P. K., Parametric min-cut analysis in a network, Discrete Applied Mathematics, 127, pp 679-689, 2003.

23. Haque, A., Y. P. Aneja, Bandyopadhyay, S., Jaekel, A.,  and Sengupta, A., "On The Logical Topology Design Of Large Multi-Hop Optical Networks",  in SPIE/ Kluwer Optical Networks Magazine, pages 96-105, Vol. 3, No, 4, 2002.

24. Y. P. Aneja, Chandrasekaran, R., Nair, K. P. K., Maximizing Residual flow Under and Arc Destruction, Networks, 38, pp 194-198, 2001.

25. Kabadi, S. N., Y. P. Aneja, Equivalence of e-Approximate Separation and Optimization in fixed Dimensions, Algorithmica, 29, pp 582-294, 2001.

Grants & Awards:
NSERC Discovery Grant, $19000 per year, 2011-2016.