![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Navneet Vidyarthi
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j15]Prasanna Ramamoorthy
, Navneet Vidyarthi
, Manish Verma
:
Efficient solution approaches for the bi-criteria p-hub median and dispersion problem. Eur. J. Oper. Res. 314(1): 79-93 (2024) - 2023
- [j14]Sachin Jayaswal
, Navneet Vidyarthi
:
Multiple allocation hub location with service level constraints for two shipment classes. Eur. J. Oper. Res. 309(2): 634-655 (2023) - 2022
- [j13]Aditya Malik
, Iván A. Contreras
, Navneet Vidyarthi:
Two-Level Capacitated Discrete Location with Concave Costs. Transp. Sci. 56(6): 1703-1722 (2022) - 2021
- [j12]Sneha Dhyani Bhatt
, Sachin Jayaswal, Ankur Sinha, Navneet Vidyarthi:
Alternate second order conic program reformulations for hub location under stochastic demand and congestion. Ann. Oper. Res. 304(1): 481-527 (2021) - 2018
- [j11]Nader Azizi
, Navneet Vidyarthi, Satyaveer Singh Chauhan:
Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Ann. Oper. Res. 264(1-2): 1-40 (2018) - [j10]Prasanna Ramamoorthy
, Sachin Jayaswal
, Ankur Sinha, Navneet Vidyarthi:
Multiple allocation hub interdiction and protection problems: Model formulations and solution approaches. Eur. J. Oper. Res. 270(1): 230-245 (2018) - 2017
- [j9]Sachin Jayaswal
, Navneet Vidyarthi:
Facility location under service level constraints for heterogeneous customers. Ann. Oper. Res. 253(1): 275-305 (2017) - [j8]Iván A. Contreras
, Moayad Tanash
, Navneet Vidyarthi:
Exact and heuristic approaches for the cycle hub location problem. Ann. Oper. Res. 258(2): 655-677 (2017) - [j7]Moayad Tanash
, Iván A. Contreras
, Navneet Vidyarthi:
An exact algorithm for the modular hub location problem with single assignments. Comput. Oper. Res. 85: 32-44 (2017) - [j6]Sachin Jayaswal
, Navneet Vidyarthi, Sagnik Das
:
A cutting plane approach to combinatorial bandwidth packing problem with queuing delays. Optim. Lett. 11(1): 225-239 (2017) - 2016
- [j5]Nader Azizi, Satyaveer Singh Chauhan, Saïd Salhi
, Navneet Vidyarthi:
The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Comput. Oper. Res. 65: 174-188 (2016) - [j4]Navneet Vidyarthi, Sachin Jayaswal
, Vikranth Babu Tirumala Chetty:
Bandwidth packing problem with queueing delays: modelling and exact solution approach. J. Glob. Optim. 65(4): 745-776 (2016) - 2014
- [j3]Navneet Vidyarthi
, Sachin Jayaswal
:
Efficient solution of a class of location-allocation problems with stochastic demand and congestion. Comput. Oper. Res. 48: 20-30 (2014) - 2011
- [j2]Jagdish Pathak, Navneet Vidyarthi:
Cost Framework for Evaluation of Information Technology Alternatives in Supply Chain. Int. J. Strateg. Decis. Sci. 2(1): 66-84 (2011) - 2007
- [j1]Navneet Vidyarthi, Emre Çelebi
, Samir Elhedhli, Elizabeth M. Jewkes:
Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution. Transp. Sci. 41(3): 392-408 (2007)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-20 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint