Yash P. Aneja

Publication Activity (10 Years)

Years Active: 1980-2022
Publications (10 Years): 16

Top Topics

Connected Dominating Set

Implicit Enumeration

Network Design Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

Yogesh Kumar Agarwal, Yash P. Aneja, Sachin Jayaswal
Directed fixed charge multicommodity network design: A cutting plane approach using polar duality. Eur. J. Oper. Res. 299 (1) (2022)
Dapei Jiang, Xiangyong Li, Yash P. Aneja, Wei Wang, Peng Tian
Integrating order delivery and return operations for order fulfillment in an online retail environment. Comput. Oper. Res. 143 (2022)
Xiangyong Li, Yash P. Aneja
A new branch-and-cut approach for the generalized regenerator location problem. Ann. Oper. Res. 295 (1) (2020)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
A separator-based method for generating weakly chordal graphs. Discret. Math. Algorithms Appl. 12 (4) (2020)
Xiangyong Li, Yash P. Aneja
A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem. Comput. Oper. Res. 115 (2020)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
A separator-based method for generating weakly chordal graphs. CoRR (2019)
Xiangyong Li, Jieqi Li, Yash P. Aneja, Zhaoxia Guo, Peng Tian
Integrated order allocation and order routing problem for e-order fulfillment. IISE Trans. 51 (10) (2019)
Md. Zamilur Rahman, Udayamoorthy Navaneetha Krishnan, Cory Jeane, Asish Mukhopadhyay, Yash P. Aneja
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. Trans. Comput. Sci. 33 (2018)
Udayamoorthy Navaneetha Krishnan, Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach. ICCSA (2) (2018)
Xiangyong Li, Chongfang Yue, Yash P. Aneja, Si Chen, Youzhi Cui
An Iterated Tabu Search Metaheuristic for the Regenerator Location Problem. Appl. Soft Comput. 70 (2018)
Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja
An Algorithm for Generating Strongly Chordal Graphs. CoRR (2018)
Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. CoRR (2017)
Xiangyong Li, Shaochong Lin, Si Chen, Yash P. Aneja, Peng Tian, Youzhi Cui
An iterated metaheuristic for the directed network design problem with relays. Comput. Ind. Eng. 113 (2017)
Yogesh Kumar Agarwal, Yash P. Aneja
Fixed charge multicommodity network design using p-partition facets. Eur. J. Oper. Res. 258 (1) (2017)
Xiangyong Li, Kai Wei, Yash P. Aneja, Peng Tian, Youzhi Cui
Matheuristics for the single-path design-balanced service network design problem. Comput. Oper. Res. 77 (2017)
Xiangyong Li, Yash P. Aneja
Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms. Eur. J. Oper. Res. 257 (1) (2017)
Arijit Paul, Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja
A fast approach to solve the Route and Spectrum Allocation problem in OFDM networks. ICDCN (2015)
Ripudamanlall Ramlall, Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay
Optimal regenerator placement for path protection in impairment-aware WDM networks. HPSR (2015)
Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja
Optimal regenerator placement in translucent optical networks. Opt. Switch. Netw. 15 (2015)
Arijit Paul, Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja
An optimal and a heuristic algorithm for solving the route and spectrum allocation problem in OFDM networks. Photonic Netw. Commun. 30 (2) (2015)
Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel
Optimal regenerator placement in survivable translucent networks. DRCN (2014)
Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja
On static RWA in translucent optical networks. ISCC (2012)
Xiangyong Li, Yash P. Aneja
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks. INFORMS J. Comput. 24 (3) (2012)
Yogesh Kumar Agarwal, Yash P. Aneja
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron. Oper. Res. 60 (3) (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. Opt. Switch. Netw. 9 (4) (2012)
Quazi Rahman, Ashutosh Sood, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel
Logical Topology Design for WDM Networks Using Tabu Search. ICDCN (2012)
Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher
On generalized balanced optimization problems. Math. Methods Oper. Res. 73 (1) (2011)
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. Comput. Oper. Res. 38 (1) (2011)
Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja
A Branch, Price and Cut Approach for Optimal Traffic Grooming in WDM Optical Networks. ICC (2011)
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. Eur. J. Oper. Res. 204 (3) (2010)
Xiangyong Li, Md. Fazle Baki, Yash P. Aneja
An ant colony optimization metaheuristic for machine-part cell formation problems. Comput. Oper. Res. 37 (12) (2010)
Quazi Rahman, Subir Bandyopadhyay, Ataul Bari, Arunita Jaekel, Yash P. Aneja
Path Protection in Translucent WDM Optical Networks. ICDCN (2010)
Xiangyong Li, Yash P. Aneja, Md. Fazle Baki
An ant colony optimization metaheuristic for single-path multicommodity network flow problems. J. Oper. Res. Soc. 61 (9) (2010)
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)
Xiangyong Li, Yash P. Aneja
A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. COCOA (2009)
Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja
Integer version of the multipath flow network synthesis problem. Discret. Appl. Math. 156 (18) (2008)
Xiangyong Li, Yash P. Aneja, Md. Fazle Baki
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA (2008)
Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja
A new approach for designing fault-tolerant WDM networks. Comput. Networks 52 (18) (2008)
Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair
Flows over edge-disjoint mixed multipaths and applications. Discret. Appl. Math. 155 (15) (2007)
Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay
Some studies on path protection in WDM networks. Photonic Netw. Commun. 14 (2) (2007)
Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja
Logical Topology Design for WDM Networks Using Survivable Routing. ICC (2006)
Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel
On routing in large WDM networks. Opt. Switch. Netw. 3 (3-4) (2006)
Subir Bandyopadhyay, Arunita Jaekel, Yash P. Aneja, Subrata Saha
A Comparative Study of Schemes for Robust Logical Topology Design in Wavelength Routed WDM Networks. Wireless and Optical Communications (2006)
Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay
Approximation algorithms for traffic routing in wavelength routed WDM networks. BROADNETS (2005)
Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel, S. Dey
An Efficient Algorithm for Routing in WDM Networks. Systems Communications (2005)
Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay
An Improved ILP Formulation for Path Protection in WDM Networks. HSNMC (2004)
Abraham P. Punnen, Yash P. Aneja
Lexicographic balanced optimization problems. Oper. Res. Lett. 32 (1) (2004)
R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143 (1-3) (2004)
Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair
Minimal-cost system reliability with discrete-choice sets for components. IEEE Trans. Reliab. 53 (1) (2004)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Parametric analysis of overall min-cuts and applications in undirected networks. Inf. Process. Lett. 85 (2) (2003)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Parametric Min-cuts Analysis in a Network. Discret. Appl. Math. 127 (3) (2003)
Santosh N. Kabadi, Yash P. Aneja
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29 (4) (2001)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Maximizing residual flow under an arc destruction. Networks 38 (4) (2001)
Yash P. Aneja, Hichem Kamoun
Scheduling of parts and robot activities in a two machine robotic cell. Comput. Oper. Res. 26 (4) (1999)
Yash P. Aneja, Abraham P. Punnen
Multiple bottleneck assignment problem. Eur. J. Oper. Res. 112 (1) (1999)
P. T. Sokkalingam, Yash P. Aneja
Lexicographic bottleneck combinatorial problems. Oper. Res. Lett. 23 (1-2) (1998)
Santosh N. Kabadi, Yash P. Aneja
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64 (4) (1997)
Abraham P. Punnen, Yash P. Aneja
Minimum Dispersion Problems. Discret. Appl. Math. 75 (1) (1997)
Abraham P. Punnen, Yash P. Aneja
On k-sum optimization. Oper. Res. Lett. 18 (5) (1996)
Yash P. Aneja, Mahmut Parlar
Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel. Transp. Sci. 28 (1) (1994)
V. Rajendra Prasad, K. P. K. Nair, Yash P. Aneja
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems. Oper. Res. 39 (3) (1991)
Yash P. Aneja, V. Aggarwal, K. P. K. Nair
Shortest chain subject to side constraints. Networks 13 (2) (1983)
V. Aggarwal, Yash P. Aneja, K. P. K. Nair
Minimal spanning tree subject to a side constraint. Comput. Oper. Res. 9 (4) (1982)
Yash P. Aneja, K. P. K. Nair
Maximal expected flow in a network subject to arc failures. Networks 10 (1) (1980)
Yash P. Aneja
An integer linear programming approach to the steiner problem in graphs. Networks 10 (2) (1980)