Vishnu Narayanan

According to our database1, Vishnu Narayanan authored at least 20 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Switch and Conquer: Efficient Algorithms By Switching Stochastic Gradient Oracles For Decentralized Saddle Point Problems.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Submodular function minimization and polarity.
Math. Program., 2022

Stochastic Gradient Methods with Compressed Communication for Decentralized Saddle Point Problems.
CoRR, 2022

2021
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling.
SIAM J. Math. Data Sci., 2021

Hardware Testbed based Analytical Performance Modelling for Mobile Task Offloading in UAV Edge Cloudlets.
Proceedings of the 94th IEEE Vehicular Technology Conference, 2021

Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2017
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports.
EURO J. Transp. Logist., 2017

Intersection cuts for convex mixed integer programs from translated cones.
Discret. Optim., 2017

2016
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem.
Networks, 2016

Facility location models to locate data in information networks: a literature review.
Ann. Oper. Res., 2016

2015
Exact approaches for static data segment allocation problem in an information network.
Comput. Oper. Res., 2015

History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence.
Comput. Oper. Res., 2015

A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations.
Comput. Oper. Res., 2014

2013
Facial Structure and Representation of Integer Hulls of Convex Sets.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2011
Lifting for conic mixed-integer programming.
Math. Program., 2011

2010
Conic mixed-integer rounding cuts.
Math. Program., 2010

2009
The submodular knapsack polytope.
Discret. Optim., 2009

2008
Polymatroids and mean-risk minimization in discrete optimization.
Oper. Res. Lett., 2008

2007
Cuts for Conic Mixed-Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007


  Loading...