default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYogesh Kumar Agarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j19]Faiz Hamid
, Yogesh Kumar Agarwal:
Train stop scheduling problem: An exact approach using valid inequalities and polar duality. Eur. J. Oper. Res. 313(1): 207-224 (2024)- 2023
- [j18]Gourav Dwivedi, Shuvabrata Chakraborty, Yogesh Kumar Agarwal, Rajiv K. Srivastava:
Simultaneous Production and Transportation Problem: A Case of Additive Manufacturing. Transp. Sci. 57(3): 741-755 (2023) - 2022
- [j17]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): 118-136 (2022) - [j16]Yogesh Kumar Agarwal, Prahalad Venkateshan:
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries. Networks 79(4): 537-556 (2022) - 2021
- [j15]Shuvabrata Chakraborty, Yogesh Kumar Agarwal:
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach. Networks 78(4): 443-460 (2021) - 2020
- [j14]Yogesh Kumar Agarwal, Prahalad Venkateshan:
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries. Oper. Res. Lett. 48(1): 48-54 (2020) - 2019
- [j13]Yogesh Kumar Agarwal, Prahalad Venkateshan:
New Valid Inequalities for the Optimal Communication Spanning Tree Problem. INFORMS J. Comput. 31(2): 268-284 (2019) - 2018
- [j12]Yogesh Kumar Agarwal:
Network Loading Problem: Valid inequalities from 5- and higher partitions. Comput. Oper. Res. 99: 123-134 (2018) - 2017
- [j11]Yogesh Kumar Agarwal, Yash P. Aneja:
Fixed charge multicommodity network design using p-partition facets. Eur. J. Oper. Res. 258(1): 124-135 (2017) - 2016
- [j10]Yogesh Kumar Agarwal, Prahalad Venkateshan:
Near optimal design of wavelength routed optical networks. Eur. J. Oper. Res. 250(3): 990-1000 (2016) - 2015
- [j9]Faiz Hamid, Yogesh Kumar Agarwal:
Solving the two-facility network design problem with 3-partition facets. Networks 66(1): 11-32 (2015) - 2014
- [j8]Ashutosh Nigam, Yogesh Kumar Agarwal:
Optimal relay node placement in delay constrained wireless sensor network design. Eur. J. Oper. Res. 233(1): 220-233 (2014) - [j7]Yogesh Kumar Agarwal, Prahalad Venkateshan:
Survivable network design with shared-protection routing. Eur. J. Oper. Res. 238(3): 836-845 (2014) - 2013
- [j6]Yogesh Kumar Agarwal:
Design of Survivable Networks Using Three- and Four-Partition Facets. Oper. Res. 61(1): 199-213 (2013) - 2012
- [j5]Yogesh Kumar Agarwal, Yash P. Aneja:
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron. Oper. Res. 60(3): 638-654 (2012) - 2009
- [j4]Yogesh Kumar Agarwal:
Polyhedral structure of the 4-node network design problem. Networks 54(3): 139-149 (2009) - 2008
- [j3]Bhaswar Choudhury, Yogesh Kumar Agarwal, K. N. Singh, D. K. Bandyopadhyay:
Value of Information in a Capacitated Supply Chain. INFOR Inf. Syst. Oper. Res. 46(2): 117-127 (2008) - 2006
- [j2]Yogesh Kumar Agarwal:
k-Partition-based facets of the network design problem. Networks 47(3): 123-139 (2006) - 2002
- [j1]Yogesh Kumar Agarwal:
Design of Capacitated Multicommodity Networks with Multiple Facilities. Oper. Res. 50(2): 333-344 (2002)
Conference and Workshop Papers
- 2012
- [c3]Ashutosh Nigam, Yogesh Kumar Agarwal:
Optimal relay placement in Wireless Sensor networks using node cut inequalities. COMSNETS 2012: 1-8 - 2011
- [c2]Yogesh Kumar Agarwal:
Survivable network design using polyhedral approaches. COMSNETS 2011: 1-6 - [c1]Faiz Hamid, Yogesh Kumar Agarwal:
A Polyhedral Approach for Solving Two Facility Network Design Problem. INOC 2011: 92-97
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-05-08 21:51 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:
