Conic mixed-integer rounding cuts A Atamtürk, V Narayanan Mathematical programming 122 (1), 1-20, 2010 | 163 | 2010 |

Polymatroids and mean-risk minimization in discrete optimization A Atamtürk, V Narayanan Operations Research Letters 36 (5), 618-622, 2008 | 134 | 2008 |

Lifting for conic mixed-integer programming A Atamtürk, V Narayanan Mathematical programming 126 (2), 351-363, 2011 | 81 | 2011 |

The submodular knapsack polytope A Atamtürk, V Narayanan Discrete Optimization 6 (4), 333-344, 2009 | 67 | 2009 |

Cuts for conic mixed-integer programming A Atamtürk, V Narayanan Integer Programming and Combinatorial Optimization: 12th International IPCO …, 2007 | 47 | 2007 |

Particle swarm optimization for resource constrained-project scheduling problem with varying resource levels J Joy, S Rajeev, V Narayanan Procedia Technology 25, 948-954, 2016 | 35 | 2016 |

Exact approaches for static data segment allocation problem in an information network G Sen, M Krishnamoorthy, N Rangaraj, V Narayanan Computers & Operations Research 62, 282-295, 2015 | 27 | 2015 |

Submodular function minimization and polarity A Atamtürk, V Narayanan Mathematical Programming, 1-11, 2022 | 18 | 2022 |

Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem G Sen, M Krishnamoorthy, N Rangaraj, V Narayanan Networks 68 (1), 4-22, 2016 | 18 | 2016 |

Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations NR Dayama, M Krishnamoorthy, A Ernst, V Narayanan, N Rangaraj Computers & operations research 52, 68-83, 2014 | 18 | 2014 |

Facility location models to locate data in information networks: a literature review G Sen, M Krishnamoorthy, N Rangaraj, V Narayanan Annals of Operations Research 246, 313-348, 2016 | 14 | 2016 |

History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence NR Dayama, M Krishnamoorthy, A Ernst, N Rangaraj, V Narayanan Computers & Operations Research 64, 245-261, 2015 | 11 | 2015 |

Memory-efficient structured convex optimization via extreme point sampling N Shinde, V Narayanan, J Saunderson SIAM Journal on Mathematics of Data Science 3 (3), 787-814, 2021 | 9 | 2021 |

New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports NR Dayama, A Ernst, M Krishnamoorthy, V Narayanan, N Rangaraj EURO Journal on Transportation and Logistics 6 (4), 307-348, 2017 | 8 | 2017 |

Memory-efficient approximation algorithms for max-k-Cut and correlation clustering N Shinde, V Narayanan, J Saunderson Advances in Neural Information Processing Systems 34, 8269-8281, 2021 | 3 | 2021 |

A few more lonely runners A Bhardwaj, V Narayanan, H Venkataraman arXiv preprint arXiv:2211.08749, 2022 | 2 | 2022 |

A benders decomposition approach for static data segment location to servers connected by a tree backbone G Sen, M Krishnamoorthy, V Narayanan, N Rangaraj Operations Research Proceedings 2015: Selected Papers of the International …, 2017 | 2 | 2017 |

Exact augmented lagrangian duality for mixed integer convex optimization A Bhardwaj, V Narayanan, A Pathapati SIAM Journal on Optimization 34 (2), 1622-1645, 2024 | 1 | 2024 |

A computational model to understand the interaction of nanosecond pulsed laser with ultra-thin SiNx layer-coated silicon substrate P Rana, V Narayanan, A Kottantharayil, D Marla Journal of Manufacturing Processes 119, 1-15, 2024 | 1 | 2024 |

An inexact frank-wolfe algorithm for composite convex optimization involving a self-concordant function N Shinde, V Narayanan, J Saunderson arXiv preprint arXiv:2310.14482, 2023 | 1 | 2023 |