default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVishnu Narayanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Chhavi Sharma, Vishnu Narayanan, P. Balamurugan:
Distributed accelerated gradient methods with restart under quadratic growth condition. J. Glob. Optim. 90(1): 153-215 (2024)- [j14]Avinash Bhardwaj
, Vishnu Narayanan, Abhishek Pathapati:
Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization. SIAM J. Optim. 34(2): 1622-1645 (2024) - 2023
- [c6]Chhavi Sharma, Vishnu Narayanan, P. Balamurugan:
Switch and Conquer: Efficient Algorithms By Switching Stochastic Gradient Oracles For Decentralized Saddle Point Problems. CDC 2023: 1312-1319 - [i3]Chhavi Sharma, Vishnu Narayanan, P. Balamurugan:
Switch and Conquer: Efficient Algorithms By Switching Stochastic Gradient Oracles For Decentralized Saddle Point Problems. CoRR abs/2309.00997 (2023) - 2022
- [j13]Alper Atamtürk, Vishnu Narayanan:
Submodular function minimization and polarity. Math. Program. 196(1): 57-67 (2022) - [i2]Chhavi Sharma, Vishnu Narayanan, P. Balamurugan:
Stochastic Gradient Methods with Compressed Communication for Decentralized Saddle Point Problems. CoRR abs/2205.14452 (2022) - 2021
- [j12]Nimita Shinde, Vishnu Narayanan, James Saunderson:
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling. SIAM J. Math. Data Sci. 3(3): 787-814 (2021) - [c5]Nimita Shinde, Vishnu Narayanan, James Saunderson:
Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering. NeurIPS 2021: 8269-8281 - [c4]Gaurang Bansal, Abhishek Tyagi, Vishnu Narayanan, Vinay Chamola:
Hardware Testbed based Analytical Performance Modelling for Mobile Task Offloading in UAV Edge Cloudlets. VTC Fall 2021: 1-5
2010 – 2019
- 2019
- [i1]Alper Atamtürk, Vishnu Narayanan:
Submodular Function Minimization and Polarity. CoRR abs/1912.13238 (2019) - 2017
- [j11]Umakanta Pattanayak, Vishnu Narayanan:
Intersection cuts for convex mixed integer programs from translated cones. Discret. Optim. 24: 103-128 (2017) - [j10]Niraj Ramesh Dayama, Andreas T. Ernst, Mohan Krishnamoorthy, Vishnu Narayanan, Narayan Rangaraj:
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports. EURO J. Transp. Logist. 6(4): 307-348 (2017) - 2016
- [j9]Goutam Sen, Mohan Krishnamoorthy, Narayan Rangaraj, Vishnu Narayanan:
Facility location models to locate data in information networks: a literature review. Ann. Oper. Res. 246(1-2): 313-348 (2016) - [j8]Goutam Sen, Mohan Krishnamoorthy, Narayan Rangaraj, Vishnu Narayanan:
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. Networks 68(1): 4-22 (2016) - 2015
- [j7]Goutam Sen, Mohan Krishnamoorthy, Narayan Rangaraj, Vishnu Narayanan:
Exact approaches for static data segment allocation problem in an information network. Comput. Oper. Res. 62: 282-295 (2015) - [j6]Niraj Ramesh Dayama, Mohan Krishnamoorthy, Andreas T. Ernst, Narayan Rangaraj, Vishnu Narayanan:
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence. Comput. Oper. Res. 64: 245-261 (2015) - [c3]Goutam Sen, Mohan Krishnamoorthy, Vishnu Narayanan, Narayan Rangaraj:
A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. OR 2015: 109-116 - 2014
- [j5]Niraj Ramesh Dayama, Mohan Krishnamoorthy, Andreas T. Ernst, Vishnu Narayanan, Narayan Rangaraj:
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Comput. Oper. Res. 52: 68-83 (2014) - 2013
- [c2]Vishnu Narayanan:
Facial Structure and Representation of Integer Hulls of Convex Sets. IPCO 2013: 302-313 - 2011
- [j4]Alper Atamtürk, Vishnu Narayanan:
Lifting for conic mixed-integer programming. Math. Program. 126(2): 351-363 (2011) - 2010
- [j3]Alper Atamtürk, Vishnu Narayanan:
Conic mixed-integer rounding cuts. Math. Program. 122(1): 1-20 (2010)
2000 – 2009
- 2009
- [j2]Alper Atamtürk, Vishnu Narayanan:
The submodular knapsack polytope. Discret. Optim. 6(4): 333-344 (2009) - 2008
- [j1]Alper Atamtürk, Vishnu Narayanan:
Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36(5): 618-622 (2008) - 2007
- [c1]Alper Atamtürk, Vishnu Narayanan:
Cuts for Conic Mixed-Integer Programming. IPCO 2007: 16-29
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-08-20 23:02 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:
