Остановите войну!
for scientists:
default search action
Yash P. Aneja
- > Home > Persons > Yash P. Aneja
Publications
- 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) - 2020
- [j44]Xiangyong Li, Yash P. Aneja:
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) - 2019
- [j41]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): 1128-1150 (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) - 2017
- [j38]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: 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) - 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) - 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) - 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) - 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 - 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
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-04-25 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint