Cuts for Conic Mixed-Integer Programming. - Alper Atamtürk; Vishnu Narayanan (IPCO, 2007)

Polymatroids and mean-risk minimization in discrete optimization. - Alper Atamtürk; Vishnu Narayanan (Oper. Res. Lett., 2008)

The submodular knapsack polytope. - Alper Atamtürk; Vishnu Narayanan (Discret. Optim., 2009)

Conic mixed-integer rounding cuts. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2010)

Lifting for conic mixed-integer programming. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2011)

Facial Structure and Representation of Integer Hulls of Convex Sets. - Vishnu Narayanan (IPCO, 2013)

Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. - Niraj Ramesh Dayama; Mohan Krishnamoorthy; Andreas T. Ernst; Vishnu Narayanan; Narayan Rangaraj (Comput. Oper. Res., 2014)

A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. - Goutam Sen; Mohan Krishnamoorthy; Vishnu Narayanan; Narayan Rangaraj (OR, 2015)

History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence. - Niraj Ramesh Dayama; Mohan Krishnamoorthy; Andreas T. Ernst; Narayan Rangaraj; Vishnu Narayanan (Comput. Oper. Res., 2015)

Exact approaches for static data segment allocation problem in an information network. - Goutam Sen; Mohan Krishnamoorthy; Narayan Rangaraj; Vishnu Narayanan (Comput. Oper. Res., 2015)

Facility location models to locate data in information networks: a literature review. - Goutam Sen; Mohan Krishnamoorthy; Narayan Rangaraj; Vishnu Narayanan (Ann. Oper. Res., 2016)

Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. - Goutam Sen; Mohan Krishnamoorthy; Narayan Rangaraj; Vishnu Narayanan (Networks, 2016)

Intersection cuts for convex mixed integer programs from translated cones. - Umakanta Pattanayak; Vishnu Narayanan (Discret. Optim., 2017)

New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports. - Niraj Ramesh Dayama; Andreas T. Ernst; Mohan Krishnamoorthy; Vishnu Narayanan; Narayan Rangaraj (EURO J. Transp. Logist., 2017)

Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering. - Nimita Shinde; Vishnu Narayanan; James Saunderson (NeurIPS, 2021)

Hardware Testbed based Analytical Performance Modelling for Mobile Task Offloading in UAV Edge Cloudlets. - Gaurang Bansal; Abhishek Tyagi; Vishnu Narayanan; Vinay Chamola (VTC Fall, 2021)

Memory-Efficient Structured Convex Optimization via Extreme Point Sampling. - Nimita Shinde; Vishnu Narayanan; James Saunderson (SIAM J. Math. Data Sci., 2021)

Stochastic Gradient Methods with Compressed Communication for Decentralized Saddle Point Problems. - Chhavi Sharma; Vishnu Narayanan; P. Balamurugan (CoRR, 2022)

Submodular function minimization and polarity. - Alper Atamtürk; Vishnu Narayanan (Math. Program., 2022)

Switch and Conquer: Efficient Algorithms By Switching Stochastic Gradient Oracles For Decentralized Saddle Point Problems. - Chhavi Sharma; Vishnu Narayanan; P. Balamurugan 001 (CDC, 2023)

MedBot - An NLP based ChatBot for Diabetes Prediction. - K. Sreekar; V. Aswin; Vishnu Narayanan; Senthil Kumar Thangavel; K. Somasundaram; Selvanayaki Kolandapalayam Shanmugam (ICCCNT, 2024)

Exact Augmented Lagrangian Duality for Mixed Integer Convex Optimization. - Avinash Bhardwaj; Vishnu Narayanan; Abhishek Pathapati (SIAM J. Optim., 2024)

Distributed accelerated gradient methods with restart under quadratic growth condition. - Chhavi Sharma; Vishnu Narayanan; P. Balamurugan 001 (J. Glob. Optim., 2024)