Home
FUTURE STUDENTS ask.UWindsor SUPPORT UWINDSOR
Odette School of Business

Yash Aneja CV

picture of yash aneja

Yash Aneja, Ph.D.
Professor Emeritus
aneja@uwindsor.ca
519-253-3000 ext. 3110
Office: OB 408

Education 

  • Ph.D.  Johns Hopkins, Baltimore, Maryland, Operations Research, 1974.
  • M.A.  Indian Statistical Institute, Calcutta, India, Statistics, 1967.
  • GD  Indian Statistical Institute, Calcutta, India, Diploma in Computer Science, 1967.
  • B.A.  Indian Statistical Institute, Calcutta, India, Statistics, 1966.

Employment Experience 

  • Professor Emeritus, Supply Chain Management & Business Data Analysis, Odette School of Business (July 2024-Present)
  • ​Area Chair, Management Science, Odette School of Business, University of Windsor (January 2007-June 2024)
  • Professor, Odette School of Business, University of Windsor (January, 1984-June 2024)
  • Professor (cross appointed), Odette School of Business/School of Computer Science, University of Windsor (July 2000-July 2014)
  • Associate Professor, University of New Brunswick (January 1979-January 1984), Fredericton.
  • Assistant Professor, University of New Brunswick (January 1974-January 1979), Fredericton.

Honours and Awards 

  • 1994:  Research Professorship Award, University of Windsor.
  • 1982:  Merit Award, University of New Brunswick.

INTELLECTUAL CONTRIBUTIONS

Books, Monographs, Compilations, Manuals 

  • Doane, D., Seward, L., Aneja, Y., & Miller, P. (2010).  Applied Statistics in Business and Economics, Canadian Edition. Canada:  McGraw-Hill Ryerson.  

Journal Articles 

  • Shiva, J., Li, X., Aneja, Y., & Li, X. (2023).  Ride-matching for the ride-hailing platform with heteogeneous drivers.   Transport Policy, 136, 169-192, https://doi.org/10.1016/j.tranpol.2023.04.001. [April]
  • Li, X., Li, X., Wang, H., Shi, J., & Aneja, Y. (2022).  Supply regulation under the exclusion policy in a ride-sourcing market.   Transportation Research Part B: Methodological, 166, 69-94, http://doi.org/10.1016/j.trb.2022.10.005. [October]
  • Jiang, D.; Li, X., Aneja, Y., Wang, W. & Tian, P. (2022). Integrating order delivery and return operations for order fulfillment in an online retail environment. Computers & Operations Research, 143, http://doi.org/10.1016/j.cor.2022.105749. [March]
  • Agarwal, Y. K.; Aneja, Y. & Jayaswal, S. (2021).  Directed fixed charge multicommodity network design: A cutting plane approach using polar duality.  European Journal of Operational Research, http://doi.org/10.1016.j.ejor.2021.08.043. [September]
  • Li, X., & Aneja, Y. (2020).  A new branch-and-cut approach for the generalized regenerator problem.   Annals of Operations Research, 295, 229-255, http://doi.org/10.1007/s10479-020-03721-6. [July]
  • Li, X., Ding, Y., Pan, K., Jiang, D., & Aneja, Y. (2020).  Single-path service network design problem with resource constraints.   Transportation Research Part E: Logistics and Transportation Review, 140, 1-27, http://doi.org/10.1016/j.tre.2020.101945. [August]
  • Rahman, Md. Z., Mukhopadhyay, A., & Aneja, Y. (2020).  A separator-based method for generating weakly chordal graphs.   Discrete Mathematics, Algorithms and Applications, 12 (4), http://doi.org/10.1142/S1793830920500391.
  • Li, X., Wei, K., Guo, Z., Wang, W., & Aneja, Y. (2020).  An exact approach for the service network design problem with heterogeneous resource constraints.   Omega: the International Journal of Management Science, http://doi.org/10.1016/j.omega.2020.102376. [November]
  • Li, X., Li, J., Aneja, Y. P., Guo, Z., & Tian, P. (2019).  Integrated order allocation and order routing problem for e-order fulfillment.   IISE Transactions: industrial engineering research and development (until 2016: IIE Transactions 0704-817X), 51 (10), 1129-1150, http://doi.org/10.1080/24725854.2018.1552820. [April]
  • Li, X., & Aneja, Y. (2019).  A branch-and-benders-cut approach for the fault tolerant regenerator location problem.   Computers & Operations Research, http://doi.org/10.1016/j.cor.2019.104847. [November]
  • Li, X., Yue, C., Aneja, Y. P., Chen, S., & Cui, Y. (2018).  An iterated tabu search metaheuristic for the regenerator location problem.   Applied Soft Computing, 70, 182-194, http://doi.org/10.1016/j.asoc.2018.05.019. [September]
  • Li, X., Wei, K., Aneja, Y., Tien, P., & Cui, Y. (2016).  Matheuristics for the single-path design-balanced service network design problem.   Computers & Operations Research, 77 (2017), 141-153, http://doi.org/10.1016/j.cor.2016.07.010. [July]
  • Li, X., Wei, K., Aneja, Y., & Tian, P. (2016).  Design-balanced capacitated multicommodity network design with heterogeneous assets.   Omega: the International Journal of Management Science, 67, 145-159, http://doi.org/10.1016/j.omega.2016.05.001. [May]
  • Li, X., Lin, S., Tian, P., & Aneja, Y. (2016).  Models and column generation approach for the resource-constrained minimum cost path problem with relays.   Omega: the International Journal of Management Science, 66 (A), 79-90, http://doi.org/10.1016/j.omega.2016.01.012. [February]
  • Agarwal, Y. K., & Aneja, Y. (2016).  Fixed charge multicommodity network design using p-partition facets.   European Journal of Operational Research, 258 (1), 124-135, http://doi.org/10.1016/j.ejor.2016.09.015. [September]
  • Li, X., & Aneja, Y. (2016).  Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms.   European Journal of Operational Research, 157 (1), 25-40, http://doi.org/10.1016/j.ejor.2016.07.032. [July]
  • Paul, A., Bandyopadhyay, S., & Aneja, Y. (2015).  An optimal and a heuristic algorithm for solving the route and spectrum allocation problem in OFDM networks.   Photonic Network Communications, 30 (2), 280-289, http://doi.org/10.1007/s11107-015-0516-0.  [October]
  • Rahman, Q., Bandyopadhyay, S., & Aneja, Y. (2015).  Optimal regenerator placement in translucent optical networks.   Optical Switching and Networking, 15, 134-147, http://doi.org/10.1016/j.osn.2014.09.002. [January]
  • Jaekel, A., Bari, A., Rahman, Q., Chen, Y., Bandyopadhyay, S., Aneja, Yash. (2012).  Resource efficient network design and traffic grooming strategy with guaranteed survivability.   Optical Switching and Networking, 9 (4), 271-285.
  • Agarwal, Y., & Aneja, Y. (2012).  Fixed-charge transportation problem: Facets of the projection polyhedron.   Operations Research, 60 (3), 638-654, http://doi.org/10.1287/opre.1120.1041. [June]
  • Li, X., Aneja, Y., & Huo, J. (2012).  Using branch-and-price approach to solve the directed network design problem with relays.   Omega: the International Journal of Management Science, 40 (5), 672-679, http://doi.org/10.1016/j.omega.2011.11.006. [August]
  • Li, X., Aneja, Y., & Ziazhen, H. (2012).  A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem.   Omega: the International Journal of Management Science, 40 (2), 210-217, http://doi.org/10.1016/j.omega.2011.05.009.
  • Turner, L., Punnen, A., Aneja, Y., & Hamacher, H.W. (2011).  On generalized balanced optimization problems.   Mathematical Methods of Operations Research, 73 (1), 19-27, http://doi.org/10.1007/s00186-010-0331-4. [February]
  • Li, X., Baki, F., & Aneja, Y. (2011).  Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.   Computers & Operations Research, 38 (1), 152-164, http://doi.org/10.1016/j.cor.2010.04.009.
  • Li, X., & Aneja, Y. (2011).  A branch-and-cut algorithm for the minimum energy broadcasting problem in wireless networks.   INFORMS Journal on Computing, 24 (3), 443-456, http://doi.org/10.1287/ijoc.1110.0463. [June]
  • Rahman, Q., Bandyopadhyay, S., Jaekel, A., & Aneja, Y. (2010).  Path protection in translucent 0ptical networks.   Lecture Notes in Computer Science, 5935, 392-403.  [February]
  • Li, X., Baki, M. F., & Aneja, Y. (2010).  Ant colony optimization metaheuristic for the machine-part cell formation problems.   Computers & Operations Research, 37 (12), 2071-2081, http://doi.org/10.1016/j.cor.2010.02.007. [December]
  • Aneja, Y., Chandrasekaran, R., Li, X., & Nair, K.P.K. (2010).  A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.   European Journal of Operational Research, 204 (3), 604-612, http://doi.org/10.1016/j.ejor.2009.10.032.
  • Li, X. Y., Aneja, Y., & Baki, F. (2009).  An ant colony optimization metaheuristic for single-path multicommodity network flow problems.   Operational Research Society. Journal, 61 (9), 1340-1355. [September]
  • Jaekel, A., Bandyopadhyay, S., & Aneja, Y. (2008).  A new approach for designing fault-tolerant WDM networks.   Computer Networks, 52 (2008), 3421-3432, http://doi.org/10.1016/j.comnet.2008.09.015.  [October]
  • Kabadi, S. N., Chandrasekaran, R., Aneja, Y., & Nair, K.P.K. (2008).  Integer version of the multipath flow network synthesis problem.   Discrete Applied Mathematics, 156 (18), 3376-3399, http://doi.org/10.1016/j.dam.2008.01.015.  
  • Aneja, Y., & Ke, X. (2007).  Multicommodity disconnecting set problem.   International Journal of Operational Research, 4 (3), 165-171.
  • Aneja, Y., Chandrasekaran, R., Kabadi, S. N., & Nair, K.P.K. (2007).  Flows over edge-disjoint mixed multipaths and applications.   Discrete Applied Mathematics, 155 (15), 1979-2000, http://doi.org/10.1016/j.dam.2007.05.001.  
  • Aneja, Y., Jaekel, A., & Bandoyopadhyay, S. (2007).  Some studies on path protection in WDM networks.   Photonic Network Communications, 14 (2), 165-176.
  • Aneja, Y., Bandyopadhyay, S., & Jaekel, A. (2006).  On routing in large WDM networks.   Optical Switching and Networking, 3 (3-4), 219-232. [December]
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (2004).  Minimal cost system reliability with discrete-choice sets for components.   IEEE Transactions on Reliability, 53 (1), 1-7, http://doi.org/10.1109/TR.2004.824829.
  • Aneja, Y., & Sokkalingam, P.T. (2004).  The minimal feedback arc set problem.   INFOR: information systems and operational research, 42 (2), 107-112.  
  • Punnen, A., & Aneja, Y. (2004).  Lexicographic balanced optimization problem extensions.   Operations Research Letters, 32 (1), 27-30, http://doi.org/10.1016/S0167-6377(03)00065-8.
  • Chandrasekaran, R., Nair, K.P.K., Aneja, Y., & Kabadi, S.N. (2004).  Multi-terminal multipath flows: Synthesis.   Discrete Applied Mathematics, 143 (1-3), 182-193, http://doi.org/10.1016/j.dam.2004.02.014.
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (2003).  Parametric analysis of overall min cuts and application in uni-directed networks.   Information Processing Letters, 85 (2), 105-109.  [January]
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (2003).  Parametric min-cut analysis in a network.   Discrete Applied Mathematics, 127 (3), 679-689, http://doi.org/10.1016/s0166-218X(02)00496-1.
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (2001).  Maximizing residual flow under an arc destruction.   Networks: an international journal, 38 (4), 194-198, http://doi.org/10.1002/net.10001.  [December]
  • Kabadi, S. N., & Aneja, Y. (2001).  Equivalence of e-approximate separation and optimization in fixed dimensions.   Algorithmica, 29, 582-594.  
  • Aneja, Y., & Kamoun, H. (1999).  Scheduling of parts and robot activities in a two machine robotic cell.   Computers & Operations Research, 26, 297-312, http://doi.org/10.1016/S0305-0548(98)00063-X.  
  • Aneja, Y., & Punnen, A. (1999).  Multiple bottleneck assignment problem.   European Journal of Operational Research, 112 (1), 167-173.
  • Aneja, Y., Kabadi, S. N., & Nagar, A. (1998).  Minimizing weighted mean absolute deviation of flow times in single machine systems.   Naval Research Logistics, 45, 297-311.  
  • Aneja, Y., & Sokkalingam, P. T. (1998).  Lexicographic bottleneck problems.   Operations Research Letters, 213, 27-33.  
  • Punnen, A., & Aneja, Y. (1997).  Minimum disperation problems.   Discrete Applied Mathematics, 75, 93-102.  
  • Kabadi, S. N., & Aneja, Y. (1997).  An efficient strongly polynomial approximation parametic optimization scheme.   Information Processing Letters, 64 (4), 173-177.  [November]
  • Punnen, A., & Aneja, Y. (1997).  Minimization of convex functions in fixed dimensions.   Operations Research Letters, 18, 171-176.  
  • Punnen, A., & Aneja, Y. (1996).  On k-sum optimization.   Operations Research Letters, 18, 233-236.  
  • Punnen, A., & Aneja, Y. (1995).  Minimax combinatorial optimization.   European Journal of Operational Research, 81 (3), 634-643, http://doi.org/10.1016/0377-2217(93)E0325-R.
  • Aneja, Y., & Kabadi, S. N. (1995).  Ratio combinatorial programs.   European Journal of Operational Research, 81 (3), 629-633, http://doi.org/10.1016/0377-2217(94)00009-2.
  • Punnen, A., & Aneja, Y. (1995).  A tabu search algorithm for the resource constrained assignment problem.   Operational Research Society. Journal, 46 (2), 214-220.
  • Punnen, A. q., Nair, K.P.K., & Aneja, Y. (1995).  Generalized bottleneck problems.   Optimization, 35, 159-169.  
  • Punnen, A., & Aneja, Y. (1994).  Categorized assignment problem: A tabu search approach.   Operational Research Society. Journal, 44, 673-679.  
  • Prasad, V. R., Nair, K.P.K., & Aneja, Y. (1994).  Generalized time-cost trade-off transportation problem.   Operational Research Society. Journal, 44, 1243-1248.  
  • Aneja, Y., & Parlar, M. (1994).  Algorithms for Weber facility location in the presence of forbidden and/or barriers to travel.   Transportation Science, 28, 70-77.
  • Nair, K.P.K., Prasad, R., & Aneja, Y. (1993).  Efficient chains in a network with time-cost tradeoff on each ARc.   European Journal of Operational Research, 66, 392-402.  
  • Aneja, Y., & Chaouch, B. A. (1993).  Capacity expansion and contraction of a facility with economies of scale.   INFOR: information systems and operational research, 31 (4), 247-260, http://doi.org/10.1080/03155986.1993.11732229.
  • Rajamani, D., Singh, N., & Aneja, Y. (1992).  Selection of parts and machines for cellularization: A mathematical programming approach.   European Journal of Operational Research, 62 (1), 47-54, http://doi.org/10.1016/03772217929017.  
  • Singh, N., Aneja, Y., & Rana, S. P. (1992).  A bicriterion framework for operations assignment and routing flexibility analysis in cellular manufacturing systems.   European Journal of Operational Research, 60, 200-210.  
  • Aneja, Y., & Nair, K. P. (1992).  Location of a tree shaped facility in a network.   INFOR: information systems and operational research, 30 (4), 319-324.  
  • Rajamani, D., Singh, N., & Aneja, Y. (1992).  A model for cell formation in manufacturing systems with sequence dependence.   International Journal of Production Research, 30, 1227-1235.  
  • Prasad, R., Aneja, Y., & Nair, K.P.K. (1991).  An heuristic approach to optimal assignment of no. 3, components to a parallel-series network.   IEEE Transactions on Reliability, 40, 555-559.
  • Prasad, R., Aneja, Y., & Nair, K.P.K. (1991).  Maximizing system reliability in series-parallel and parallel-series systems.   Operations Research, 39, 407-414.
  • Rajamani, D., Singh, D., & Aneja, Y. (1990).  Integrated design of cellular manufacturing system in the presence of alternate process plans.   International Journal of Production Research, 28, 1541-1554.  
  • Prasad, R., Aneja, Y., & Nair, K.P.K. (1990).  Optimization of bicriteria quasi-concave functions subject to linear constraints.   OPSEARCH: Journal of the Operational Research Society of India, 27, 73-92.  
  • Aneja, Y., & Singh, N. (1990).  Scheduling production of common components at a single facility.   IIE Transactions: industrial engineering research & development (Since 2016: IISE Transactions 2472-5854), 22, 234-237.  
  • Singh, N., Aneja, Y., & Rana, S. P. (1990).  Multiobjective modeling and analysis of process planning in a manufacturing system.   International Journal of Systems Science, 21 (4), 621-630, http://doi.org/10.1080/00207729008910396.
  • Mani, V., Aneja, Y., & Singh, N. (1990).  Throughput analysis of a two station closed queuing network with blocking and server breakdown.   International Journal of Systems Science, 21, 611-619, http://doi.org/10.1080/00207729008910395.
  • Aneja, Y., Chandra, R., & Gunay, E. (1989).  A portfolio approach to estimating the average correlation coefficient for the constant correlation model.   Journal of Finance, The, 44, 1435-1438, http://doi.org/10.1111/j.1540-6261.1989.tb02664.x. [December]
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (1988).  Centre location problem with rectilinear distances.   European Journal of Operational Research, 35, 118-123.  
  • Aneja, Y., & Noori, H. (1987).  A multiperiod stochastic inventory problem with lump-sum penalty cost.   Management Science, 33, 750-755.
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (1986).  Classes of linear programs with integral solutions.   Mathematical Programming Studies, 24, 225-237.  
  • Aneja, Y., & Nair, K.P.K. (1985).  Network flows with time dependent decay rates.   European Journal of Operational Research, 21, 77-81.
  • Chandrasekaran, R., Aneja, Y., & Nair, K.P.K. (1984).  Production planning in assembly line systems.   Management Science, 30, 713-719.  
  • Aneja, Y., & Nair, K.P.K. (1984).  Ratio dynamic programs.   Operations Research Letters, 3, 167-172.  
  • Aneja, Y., Aggarwal, V., & Nair, K.P.K. (1984).  On a class of quadratic programs.   European Journal of Operational Research, 18, 62-70.
  • Aneja, Y., & Parlar, M. (1984).  An extension of Park's model for forest fire control.   Canadian Journal of Forest Research, 14, 589-594.  
  • Aneja, Y., Aggarwal, V., & Nair, K.P.K. (1983).  Shortest chain with side constraints.   Networks: an international journal, 13 (2), 295-302.
  • Aggarwal, Y., Aneja, Y., & Nair, K.P.K. (1982).  Minimal spanning trees subject to a side constraint.   Computers & Operations Research, 9, 287-296.
  • Aneja, Y., & Nair, K.P (1982).  Multicommodity network flows with probabilistic gains.   Management Science, 28, 287-296.  
  • Aggarwal, V., Aneja, Y., & Nair, K.P.K. (1981).  Ratio rewards in networks.   RAIRO - Operations Research, 15, 167-178.  
  • Aneja, Y., Chandrasekaran, R., & Nair, K.P.K. (1981).  Minimal cost-reliability ratio spanning tree.   Annals of Discrete Mathematics, Special Volume: Graphs, Combinatorics and Management, 129-138.  
  • Aneja, Y. (1980).  Integer linear programming approach to the Steiner network problem.   Networks: an international journal, 10, 167-178.  
  • Aneja, Y., & Nair, K.P.K. (1980).  Maximal expected flow in a network subject to arc failures.   Networks: an international journal, 10, 45-57.
  • Aneja, Y., & Nair, K. P. (1979).  Bicriteria transportation problems.   Management Science, 25, 73-78.  
  • Aneja, Y., Aggarwal, V., & Nair, K. P. (1979).  Maximizing a vector flow in a multicommodity network.   INFOR: information systems and operational research, 17, 276-286.
  • Aneja, Y., Aggarwal, V., & Nair, K.P.K. (1979).  Two problems in multicommodity networks.   RAIRO - Operations Research, 13, 135-142.  
  • Aneja, Y., & Nair, K. P. (1978).  The constrained shores path problem.   Naval Research Logistics, 25, 549-555.  
  • Aneja, Y., & Vemuganti, R. (1977).  Finding a minimal multicommodity disconnecting set.   Management Science, 23, 652-659.  

Conference Proceedings 

  • Rahman, Md. Z., Mukhopadhyay, A., Aneja, Y. P., & Jean, C. (2017).  A distance matrix completion approach to 1-round algorithms for point placement in the plane.  In Osvaldo Gervasi, Beniamino Murgante, Sanjay Misra, Giuseppe Borruso, Carmelo M. Torre, Ana Maria A.C. Rocha, David Taniar, Bernady O. Apduhan, Elena Stankova, Alfredo Currocrea (Ed.)   International Conference on Computational Science and its Applications (ICCSA) 2017, Trieste, Italy (Part II), 494-508.
  • Ramlall, R., Rahman, Q., Aneja, Y. P., & Bandyopadhyay, S. (2015).  Optimal regenerator placement for path protection in impairment-aware WDM networks.   IEEE 2015, Canary Islands, Spain.
  • Paul, A., Bandyopadhyay, S., & Aneja, Y. P. (2015).  A fast approach to solve the Route and Spectrum Allocation problem in OFDM networks.   International Conference on Distributed Computing and Networking - ICDCN'15, Goa, India, Article 7.
  • Li, X., Aneja, Y., & Baki, F. (2008).  Ant Colony Optimization Meta-heuristic for Traffic Grooming in WDM Networks.   Proceedings of the 2nd Annual conference on Combinatorial Optimization and Applications - COCOA 2008, 235-245.
  • Aneja, Y., Jaekel, A., & Bandyopadhyay, S. (2005).  Approximation Algorithms for Traffic Routing in Wavelength Routed WDM Networks.   Broadnets 2005.
  • Aneja, Y., Bandyopadhyay, S., Jaekel, A., & De, S. (2005).  An efficient algorithm for routing in WDM networks.   ICHSNO5.
  • Aneja, Y., Jaekel, A., & Bandyopadhyay, S. (2004).  An Improved ILP Formulation for Path Protection in WDM Networks.   Lecture Notes in Computer Science (Proceedings of the International Conference on High Speed Networks and Multimedia Communications - HSNMC, 3079, 903-911.
  • Aneja, Y., Jaekel, A., & Bandyopadhyay, S. (2003).  Logical Topology Design for Fault-Tolerant WDM Networks.   Proceedings of ITCOMO3, 242-253.
  • Aneja, Y., Bandyopadhyay, S., Jaekel, A., & Sengupta, A. (2002).  An Efficient Protection Scheme for WDM Networks using Dynamic Lightpath Allocation.   HPC Asia02, 269-274.
  • Achan, K., Aneja, Y., & Bandyopadhyay, S. (2001).  Use of Tabu Search in the Logical Topology Design of Wavelength Routed Optical Networks.   HPCS 01, Windsor, ON.
  • Aneja, Y. (2001).  Routing Wavelength in Routed Optical Networks.   IEEEE 2001, 323-327.
  • Haque, A., Aneja, Y., Bandyopadhyay, S., Jaekel, F., & Sengupta, A. (2001).  Some studies on the logical topology design of large multi-hop optical networks.   Opticomm 2001, 227-241.
  • Kabadi, S., Aneja, Y., & Nair, K.P.K. (1990).  Weighted 1-Center Problem in a Simple Polygon.   Second Canadian Conference in Computational Geometry, 306-308.

Grants (Competitive; Funded only) 

  • 2011-2016: NSERC Discovery Grant ($95,000).