| Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted … N Madhushini, C Rajendran, Y Deepa Journal of the Operational Research Society 60 (7), 991-1004, 2009 | 33 | 2009 |
| Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives N Madhushini, C Rajendran European Journal of Industrial Engineering 5 (4), 361-387, 2011 | 13 | 2011 |
| Improved Conic Reformulations for -means Clustering MN Prasad, GA Hanasusanto SIAM Journal on Optimization 28 (4), 3105-3126, 2018 | 11 | 2018 |
| Branch-and-bound algorithms for scheduling in an m-machine no-wait flowshop N Madhushini, C Rajendran Sādhanā 45 (1), 255, 2020 | 8 | 2020 |
| Distributionally robust observable strategic queues Y Wang, MN Prasad, GA Hanasusanto, JJ Hasenbein Stochastic Systems, 2024 | 2 | 2024 |
| A Bottleneck-Assignment Based Branch-and-Bound Algorithm to Minimize the Makespan in an m-Machine Permutation Flowshop N Madhushini, C Rajendran Technology Operation Management 3, 1-10, 2012 | 2 | 2012 |
| Non-Aggressive Adaptive Routing in Traffic MN Prasad, N Dimitrov, E Nikolova Mathematics 11 (17), 2023 | | 2023 |
| Approximation Schemes for Network, Clustering and Queueing Models MN Prasad The University of Texas at Austin, 2018 | | 2018 |
| Improved Conic Reformulations for K-means Clustering M Narayana Prasad, GA Hanasusanto arXiv e-prints, arXiv: 1706.07105, 2017 | | 2017 |
