Yash P. Aneja

Xiangyong Li, Yash P. Aneja: A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks. INFORMS Journal on Computing 24(3): 443-456 (2012)

Yogesh Agarwal, Yash P. Aneja: Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron. Operations Research 60(3): 638-654 (2012)

Arunita Jaekel, Ataul Bari, Quazi Rahman, Ying Chen, Subir Bandyopadhyay, Yash P. Aneja: Resource efficient network design and traffic grooming strategy with guaranteed survivability. Optical Switching and Networking 9(4): 271-285 (2012)

Quazi Rahman, Ashutosh Sood, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel: Logical Topology Design for WDM Networks Using Tabu Search. ICDCN 2012: 424-427

Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja: On static RWA in translucent optical networks. ISCC 2012: 171-176

Xiangyong Li, Md. Fazle Baki, Yash P. Aneja: Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic. Computers & OR 38(1): 152-164 (2011)

Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher: On generalized balanced optimization problems. Math. Meth. of OR 73(1): 19-27 (2011)

Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja: A Branch, Price and Cut Approach for Optimal Traffic Grooming in WDM Optical Networks. ICC 2011: 1-6

Xiangyong Li, M. F. Baki, Yash P. Aneja: An ant colony optimization metaheuristic for machine-part cell formation problems. Computers & OR 37(12): 2071-2081 (2010)

Yash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair: A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. European Journal of Operational Research 204(3): 604-612 (2010)

Xiangyong Li, Yash P. Aneja, Md. Fazle Baki: An ant colony optimization metaheuristic for single-path multicommodity network flow problems. JORS 61(9): 1340-1355 (2010)

Quazi Rahman, Subir Bandyopadhyay, Ataul Bari, Arunita Jaekel, Yash P. Aneja: Path Protection in Translucent WDM Optical Networks. ICDCN 2010: 392-403

Xiangyong Li, Yash P. Aneja: A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. COCOA 2009: 494-506

Yash P. Aneja, Ataul Bari, Arunita Jaekel, Ramaswamy Chandrasekaran, K. P. K. Nair: Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks. ICC 2009: 1-5

Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja: A new approach for designing fault-tolerant WDM networks. Computer Networks 52(18): 3421-3432 (2008)

Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja: Integer version of the multipath flow network synthesis problem. Discrete Applied Mathematics 156(18): 3376-3399 (2008)

Xiangyong Li, Yash P. Aneja, Md. Fazle Baki: Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA 2008: 235-245

Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair: Flows over edge-disjoint mixed multipaths and applications. Discrete Applied Mathematics 155(15): 1979-2000 (2007)

Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel: On routing in large WDM networks. Optical Switching and Networking 3(3-4): 219-232 (2006)

Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja: Logical Topology Design for WDM Networks Using Survivable Routing. ICC 2006: 2471-2476

Subir Bandyopadhyay, Arunita Jaekel, Yash P. Aneja, S. Saha: A Comparative Study of Schemes for Robust Logical Topology Design in Wavelength Routed WDM Networks. Wireless and Optical Communications 2006: 230-236

Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay: Approximation algorithms for traffic routing in wavelength routed WDM networks. BROADNETS 2005: 25-32

Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel, S. Dey: An Efficient Algorithm for Routing in WDM Networks. ICW/ICHSN/ICMCS/SENET 2005: 268-274

R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi: Multi-terminal multipath flows: synthesis. Discrete Applied Mathematics 143(1-3): 182-193 (2004)

Abraham P. Punnen, Yash P. Aneja: Lexicographic balanced optimization problems. Oper. Res. Lett. 32(1): 27-30 (2004)

Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair: Minimal-cost system reliability with discrete-choice sets for components. IEEE Transactions on Reliability 53(1): 71-76 (2004)

Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay: An Improved ILP Formulation for Path Protection in WDM Networks. HSNMC 2004: 903-911

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair: Parametric Min-cuts Analysis in a Network. Discrete Applied Mathematics 127(3): 679-689 (2003)

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair: Parametric analysis of overall min-cuts and applications in undirected networks. Inf. Process. Lett. 85(2): 105-109 (2003)

Santosh N. Kabadi, Yash P. Aneja: Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29(4): 582-594 (2001)

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair: Maximizing residual flow under an arc destruction. Networks 38(4): 194-198 (2001)

Yash P. Aneja, Hichem Kamoun: Scheduling of parts and robot activities in a two machine robotic cell. Computers & OR 26(4): 297-312 (1999)

Yash P. Aneja, Abraham P. Punnen: Multiple bottleneck assignment problem. European Journal of Operational Research 112(1): 167-173 (1999)

P. T. Sokkalingam, Yash P. Aneja: Lexicographic bottleneck combinatorial problems. Oper. Res. Lett. 23(1-2): 27-33 (1998)

Abraham P. Punnen, Yash P. Aneja: Minimum Dispersion Problems. Discrete Applied Mathematics 75(1): 93-102 (1997)

Santosh N. Kabadi, Yash P. Aneja: An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64(4): 173-177 (1997)

Yash P. Aneja, V. Aggarwal, K. P. K. Nair: Shortest chain subject to side constraints. Networks 13(2): 295-302 (1983)

V. Aggarwal, Yash P. Aneja, K. P. K. Nair: Minimal spanning tree subject to a side constraint. Computers & OR 9(4): 287-296 (1982)

Yash P. Aneja, K. P. K. Nair: Maximal expected flow in a network subject to arc failures. Networks 10(1): 45-57 (1980)

Yash P. Aneja: An integer linear programming approach to the steiner problem in graphs. Networks 10(2): 167-178 (1980)