Yash P. Aneja

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