default search action
Yash P. Aneja
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j46]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: 105749 (2022) - [j45]Yogesh Kumar Agarwal
Directed fixed charge multicommodity network design: A cutting plane approach using polar duality. Eur. J. Oper. Res. 299(1): 118-136 (2022) - 2020
- [j44]Xiangyong Li
A new branch-and-cut approach for the generalized regenerator location problem. Ann. Oper. Res. 295(1): 229-255 (2020) - [j43]Xiangyong Li, Yash P. Aneja:
A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem. Comput. Oper. Res. 115: 104847 (2020) - [j42]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. Discret. Math. Algorithms Appl. 12(4): 2050039:1-2050039:16 (2020)
2010 – 2019
- 2019
- [j41]Xiangyong Li
Integrated order allocation and order routing problem for e-order fulfillment. IISE Trans. 51(10): 1128-1150 (2019) - [i3]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
A separator-based method for generating weakly chordal graphs. CoRR abs/1906.01056 (2019) - 2018
- [j40]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: 182-194 (2018) - [j39]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: 97-114 (2018) - [c17]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: 412-424 - [i2]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash P. Aneja:
An Algorithm for Generating Strongly Chordal Graphs. CoRR abs/1804.09019 (2018) - 2017
- [j38]Xiangyong Li, Shaochong Lin
An iterated metaheuristic for the directed network design problem with relays. Comput. Ind. Eng. 113: 35-45 (2017) - [j37]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: 141-153 (2017) - [j36]Xiangyong Li, Yash P. Aneja:
Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms. Eur. J. Oper. Res. 257(1): 25-40 (2017) - [j35]Yogesh Kumar Agarwal
Fixed charge multicommodity network design using p-partition facets. Eur. J. Oper. Res. 258(1): 124-135 (2017) - [c16]Md. Zamilur Rahman, Asish Mukhopadhyay, Yash Pal Aneja, Cory Jean:
A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane. ICCSA (2) 2017: 494-508 - [i1]Yash P. Aneja, Asish Mukhopadhyay, Md. Zamilur Rahman:
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem. CoRR abs/1705.09643 (2017) - 2015
- [j34]Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja:
Optimal regenerator placement in translucent optical networks. Opt. Switch. Netw. 15: 134-147 (2015) - [j33]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): 280-289 (2015) - [c15]Ripudamanlall Ramlall, Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay:
Optimal regenerator placement for path protection in impairment-aware WDM networks. HPSR 2015: 226-232 - [c14]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: 7:1-7:4 - 2014
- [c13]Quazi Rahman, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel:
Optimal regenerator placement in survivable translucent networks. DRCN 2014: 1-7 - 2012
- [j32]Xiangyong Li, Yash P. Aneja:
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks. INFORMS J. Comput. 24(3): 443-456 (2012) - [j31]Yogesh Kumar Agarwal
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron. Oper. Res. 60(3): 638-654 (2012) - [j30]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): 271-285 (2012) - [c12]Quazi Rahman, Ashutosh Sood, Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel:
Logical Topology Design for WDM Networks Using Tabu Search. ICDCN 2012: 424-427 - [c11]Quazi Rahman, Subir Bandyopadhyay, Yash P. Aneja:
On static RWA in translucent optical networks. ISCC 2012: 171-176 - 2011
- [j29]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): 152-164 (2011) - [j28]Lara Turner, Abraham P. Punnen, Yash P. Aneja, Horst W. Hamacher:
On generalized balanced optimization problems. Math. Methods Oper. Res. 73(1): 19-27 (2011) - [c10]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 - 2010
- [j27]Xiangyong Li, Md. Fazle Baki, Yash P. Aneja:
An ant colony optimization metaheuristic for machine-part cell formation problems. Comput. Oper. Res. 37(12): 2071-2081 (2010) - [j26]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): 604-612 (2010) - [j25]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): 1340-1355 (2010) - [c9]Quazi Rahman, Subir Bandyopadhyay, Ataul Bari, Arunita Jaekel, Yash P. Aneja:
Path Protection in Translucent WDM Optical Networks. ICDCN 2010: 392-403
2000 – 2009
- 2009
- [c8]Xiangyong Li, Yash P. Aneja:
A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. COCOA 2009: 494-506 - [c7]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 - 2008
- [j24]Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja:
A new approach for designing fault-tolerant WDM networks. Comput. Networks 52(18): 3421-3432 (2008) - [j23]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): 3376-3399 (2008) - [c6]Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA 2008: 235-245 - 2007
- [j22]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): 1979-2000 (2007) - [j21]Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay:
Some studies on path protection in WDM networks. Photonic Netw. Commun. 14(2): 165-176 (2007) - 2006
- [j20]Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel:
On routing in large WDM networks. Opt. Switch. Netw. 3(3-4): 219-232 (2006) - [c5]Arunita Jaekel, Subir Bandyopadhyay, Yash P. Aneja:
Logical Topology Design for WDM Networks Using Survivable Routing. ICC 2006: 2471-2476 - [c4]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: 230-236 - 2005
- [c3]Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay:
Approximation algorithms for traffic routing in wavelength routed WDM networks. BROADNETS 2005: 25-32 - [c2]Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel, S. Dey:
An Efficient Algorithm for Routing in WDM Networks. Systems Communications 2005: 268-274 - 2004
- [j19]R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143(1-3): 182-193 (2004) - [j18]Abraham P. Punnen, Yash P. Aneja:
Lexicographic balanced optimization problems. Oper. Res. Lett. 32(1): 27-30 (2004) - [j17]Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair:
Minimal-cost system reliability with discrete-choice sets for components. IEEE Trans. Reliab. 53(1): 71-76 (2004) - [c1]Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay:
An Improved ILP Formulation for Path Protection in WDM Networks. HSNMC 2004: 903-911 - 2003
- [j16]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric Min-cuts Analysis in a Network. Discret. Appl. Math. 127(3): 679-689 (2003) - [j15]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) - 2001
- [j14]Santosh N. Kabadi, Yash P. Aneja:
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. Algorithmica 29(4): 582-594 (2001) - [j13]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Maximizing residual flow under an arc destruction. Networks 38(4): 194-198 (2001)
1990 – 1999
- 1999
- [j12]Yash P. Aneja, Hichem Kamoun:
Scheduling of parts and robot activities in a two machine robotic cell. Comput. Oper. Res. 26(4): 297-312 (1999) - [j11]Yash P. Aneja, Abraham P. Punnen:
Multiple bottleneck assignment problem. Eur. J. Oper. Res. 112(1): 167-173 (1999) - 1998
- [j10]P. T. Sokkalingam, Yash P. Aneja:
Lexicographic bottleneck combinatorial problems. Oper. Res. Lett. 23(1-2): 27-33 (1998) - 1997
- [j9]Abraham P. Punnen, Yash P. Aneja:
Minimum Dispersion Problems. Discret. Appl. Math. 75(1): 93-102 (1997) - [j8]Santosh N. Kabadi, Yash P. Aneja:
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64(4): 173-177 (1997) - 1996
- [j7]Abraham P. Punnen, Yash P. Aneja:
On k-sum optimization. Oper. Res. Lett. 18(5): 233-236 (1996) - 1994
- [j6]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): 70-76 (1994) - 1991
- [j5]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): 407-414 (1991)
1980 – 1989
- 1983
- [j4]Yash P. Aneja, V. Aggarwal, K. P. K. Nair:
Shortest chain subject to side constraints. Networks 13(2): 295-302 (1983) - 1982
- [j3]V. Aggarwal, Yash P. Aneja, K. P. K. Nair:
Minimal spanning tree subject to a side constraint. Comput. Oper. Res. 9(4): 287-296 (1982) - 1980
- [j2]Yash P. Aneja, K. P. K. Nair:
Maximal expected flow in a network subject to arc failures. Networks 10(1): 45-57 (1980) - [j1]Yash P. Aneja:
An integer linear programming approach to the steiner problem in graphs. Networks 10(2): 167-178 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: