Yash P. Aneja

According to our database, Yash P. Aneja authored at least 65 papers between 1980 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Directed fixed charge multicommodity network design: A cutting plane approach using polar duality.

Yogesh Kumar Agarwal, Yash P. Aneja, Sachin Jayaswal

Eur. J. Oper. Res., 2022

Integrating order delivery and return operations for order fulfillment in an online retail environment.

Dapei Jiang, Xiangyong Li, Yash P. Aneja, Wei Wang, Peng Tian

Comput. Oper. Res., 2022

2020

A separator-based method for generating weakly chordal graphs.

Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja

Discret. Math. Algorithms Appl., 2020

A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem.

Xiangyong Li, Yash P. Aneja

Comput. Oper. Res., 2020

A new branch-and-cut approach for the generalized regenerator location problem.

Xiangyong Li, Yash P. Aneja

Ann. Oper. Res., 2020

2019

Integrated order allocation and order routing problem for e-order fulfillment.

Xiangyong Li, Jieqi Li, Yash P. Aneja, Zhaoxia Guo, Peng Tian

IISE Trans., 2019

2018

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane.

Md. Zamilur Rahman, Udayamoorthy Navaneetha Krishnan, Cory Jeane, Asish Mukhopadhyay, Yash P. Aneja

Trans. Comput. Sci., 2018

An Algorithm for Generating Strongly Chordal Graphs.

Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja

CoRR, 2018

An Iterated Tabu Search Metaheuristic for the Regenerator Location Problem.

Xiangyong Li, Chongfang Yue, Yash P. Aneja, Si Chen, Youzhi Cui

Appl. Soft Comput., 2018

Molecular Structure Determination in the Phillips' Model: A Degree of Freedom Approach.

Udayamoorthy Navaneetha Krishnan, Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja

Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017

Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms.

Xiangyong Li, Yash P. Aneja

Eur. J. Oper. Res., 2017

Fixed charge multicommodity network design using p-partition facets.

Yogesh Kumar Agarwal, Yash P. Aneja

Eur. J. Oper. Res., 2017

A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem.

Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman

CoRR, 2017

Matheuristics for the single-path design-balanced service network design problem.

Xiangyong Li, Kai Wei, Yash P. Aneja, Peng Tian, Youzhi Cui

Comput. Oper. Res., 2017

An iterated metaheuristic for the directed network design problem with relays.

Xiangyong Li, Shaochong Lin, Si Chen, Yash P. Aneja, Peng Tian, Youzhi Cui

Comput. Ind. Eng., 2017

A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane.

Md. Zamilur Rahman, Asish Mukhopadhyay, Yash Pal Aneja, Cory Jean

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2015

An optimal and a heuristic algorithm for solving the route and spectrum allocation problem in OFDM networks.

Arijit Paul, Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja

Photonic Netw. Commun., 2015

Optimal regenerator placement in translucent optical networks.

Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja

Opt. Switch. Netw., 2015

A fast approach to solve the Route and Spectrum Allocation problem in OFDM networks.

Arijit Paul, Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Optimal regenerator placement for path protection in impairment-aware WDM networks.

Ripudamanlall Ramlall, Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay

Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

2014

Optimal regenerator placement in survivable translucent networks.

Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel

Proceedings of the 10th International Conference on the Design of Reliable Communication Networks, 2014

2012

Resource efficient network design and traffic grooming strategy with guaranteed survivability.

Arunita Jaekel, Ataul Bari, Quazi Rahman, Ying Chen, Subir Bandyopadhyay, Yash P. Aneja

Opt. Switch. Netw., 2012

Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron.

Yogesh Kumar Agarwal, Yash P. Aneja

Oper. Res., 2012

A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks.

Xiangyong Li, Yash P. Aneja

INFORMS J. Comput., 2012

On static RWA in translucent optical networks.

Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja

Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

Logical Topology Design for WDM Networks Using Tabu Search.

Quazi Rahman, Ashutosh Sood, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel

Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

2011

On generalized balanced optimization problems.

Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher

Math. Methods Oper. Res., 2011

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.

Xiangyong Li, Md. Fazle Baki, Yash P. Aneja

Comput. Oper. Res., 2011

A Branch, Price and Cut Approach for Optimal Traffic Grooming in WDM Optical Networks.

Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja

Proceedings of IEEE International Conference on Communications, 2011

2010

An ant colony optimization metaheuristic for single-path multicommodity network flow problems.

Xiangyong Li, Yash P. Aneja, Md. Fazle Baki

J. Oper. Res. Soc., 2010

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.

Yash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair

Eur. J. Oper. Res., 2010

An ant colony optimization metaheuristic for machine-part cell formation problems.

Xiangyong Li, Md. Fazle Baki, Yash P. Aneja

Comput. Oper. Res., 2010

Path Protection in Translucent WDM Optical Networks.

Quazi Rahman, Subir Bandyopadhyay, Ataul Bari, Arunita Jaekel, Yash P. Aneja

Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

2009

Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks.

Yash P. Aneja, Ataul Bari, Arunita Jaekel, Ramaswamy Chandrasekaran, K. P. K. Nair

Proceedings of IEEE International Conference on Communications, 2009

A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks.

Xiangyong Li, Yash P. Aneja

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Integer version of the multipath flow network synthesis problem.

Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja

Discret. Appl. Math., 2008

A new approach for designing fault-tolerant WDM networks.

Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja

Comput. Networks, 2008

Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.

Xiangyong Li, Yash P. Aneja, Md. Fazle Baki

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Some studies on path protection in WDM networks.

Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay

Photonic Netw. Commun., 2007

Flows over edge-disjoint mixed multipaths and applications.

Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair

Discret. Appl. Math., 2007

2006

On routing in large WDM networks.

Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel

Opt. Switch. Netw., 2006

A Comparative Study of Schemes for Robust Logical Topology Design in Wavelength Routed WDM Networks.

Subir Bandyopadhyay, Arunita Jaekel, Yash P. Aneja, Subrata Saha

Proceedings of the Sixth IASTED International Multi-Conference on Wireless and Optical Communications: Conference on Communication Systems and Applications, 2006

Logical Topology Design for WDM Networks Using Survivable Routing.

Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja

Proceedings of IEEE International Conference on Communications, 2006

2005

An Efficient Algorithm for Routing in WDM Networks.

Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel, S. Dey

Proceedings of the Systems Communications 2005 (ICW / ICHSN / ICMCS / SENET 2005), 2005

Approximation algorithms for traffic routing in wavelength routed WDM networks.

Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay

Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

2004

Minimal-cost system reliability with discrete-choice sets for components.

Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair

IEEE Trans. Reliab., 2004

Lexicographic balanced optimization problems.

Abraham P. Punnen, Yash P. Aneja

Oper. Res. Lett., 2004

Multi-terminal multipath flows: synthesis.

R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi

Discret. Appl. Math., 2004

An Improved ILP Formulation for Path Protection in WDM Networks.

Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay

Proceedings of the High Speed Networks and Multimedia Communications, 2004

2003

Parametric analysis of overall min-cuts and applications in undirected networks.

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair

Inf. Process. Lett., 2003

Parametric Min-cuts Analysis in a Network.

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair

Discret. Appl. Math., 2003

2001

Maximizing residual flow under an arc destruction.

Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair

Networks, 2001

Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions.

Santosh N. Kabadi, Yash P. Aneja

Algorithmica, 2001

1999

Multiple bottleneck assignment problem.

Yash P. Aneja, Abraham P. Punnen

Eur. J. Oper. Res., 1999

Scheduling of parts and robot activities in a two machine robotic cell.

Yash P. Aneja, Hichem Kamoun

Comput. Oper. Res., 1999

1998

Lexicographic bottleneck combinatorial problems.

P. T. Sokkalingam, Yash P. Aneja

Oper. Res. Lett., 1998

1997

An Efficient, Strongly Polynomial, epsilon-Approximation Schemes.

Santosh N. Kabadi, Yash P. Aneja

Inf. Process. Lett., 1997

Minimum Dispersion Problems.

Abraham P. Punnen, Yash P. Aneja

Discret. Appl. Math., 1997

1996

On k-sum optimization.

Abraham P. Punnen, Yash P. Aneja

Oper. Res. Lett., 1996

1994

Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel.

Yash P. Aneja, Mahmut Parlar

Transp. Sci., 1994

1991

Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems.

V. Rajendra Prasad, K. P. K. Nair, Yash P. Aneja

Oper. Res., 1991

1983

Shortest chain subject to side constraints.

Yash P. Aneja, V. Aggarwal, K. P. K. Nair

Networks, 1983

1982

Minimal spanning tree subject to a side constraint.

V. Aggarwal, Yash P. Aneja, K. P. K. Nair

Comput. Oper. Res., 1982

1980

Maximal expected flow in a network subject to arc failures.

Yash P. Aneja, K. P. K. Nair

Networks, 1980

An integer linear programming approach to the steiner problem in graphs.

Yash P. Aneja

Networks, 1980