default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarsha Nagarajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i26]Hannah Moring, Harsha Nagarajan, Kshitij Girigoudar, David M. Fobes, Johanna L. Mathieu:
Robust Partitioning and Operation for Maximal Uncertain-Load Delivery in Distribution Grids. CoRR abs/2404.03137 (2024)- [i25]Neelkamal Somisetty, Harsha Nagarajan, Swaroop Darbha:
Spectral Graph Theoretic Methods for Enhancing Network Robustness in Robot Localization. CoRR abs/2409.15506 (2024) - 2023
- [j10]David M. Fobes
, Harsha Nagarajan, Russell Bent:
Optimal Microgrid Networking for Maximal Load Delivery in Phase Unbalanced Distribution Grids: A Declarative Modeling Approach. IEEE Trans. Smart Grid 14(3): 1682-1691 (2023) - [c14]Kaarthik Sundar, Harsha Nagarajan, Sidhant Misra, Mowen Lu, Carleton Coffrin, Russell Bent:
Optimization-Based Bound Tightening Using a Strengthened QC-Relaxation of the Optimal Power Flow Problem. CDC 2023: 4598-4605 - [c13]Neelkamal Somisetty, Harsha Nagarajan, Swaroop Darbha:
Impact of Ordering of Heterogeneous Vehicles on String Stability. ITSC 2023: 4524-4531 - [i24]Neelkamal Somisetty, Harsha Nagarajan, Swaroop Darbha:
Optimal Robust Network Design: Formulations and Algorithms for Maximizing Algebraic Connectivity. CoRR abs/2304.08571 (2023) - [i23]Rohit Dube, Natarajan Gautam, Amarnath Banerjee, Harsha Nagarajan:
Learning for Interval Prediction of Electricity Demand: A Cluster-based Bootstrapping Approach. CoRR abs/2309.01336 (2023) - [i22]Md Umar Hashmi, Stephen Hardy, Dirk Van Hertem, Harsha Nagarajan:
Multi-market Optimal Energy Storage Arbitrage with Capacity Blocking for Emergency Services. CoRR abs/2310.00775 (2023) - [i21]Elena R. Henderson, Harsha Nagarajan, Carleton Coffrin:
Exploring Non-Linear Programming Formulations in QuantumCircuitOpt for Optimal Circuit Design. CoRR abs/2310.18281 (2023) - 2022
- [j9]Siddharth Bhela, Harsha Nagarajan, Deepjyoti Deka, Vassilis Kekatos:
Efficient Topology Design Algorithms for Power Grid Stability. IEEE Control. Syst. Lett. 6: 1100-1105 (2022) - [j8]Haoxiang Yang, Harsha Nagarajan:
Optimal Power Flow in Distribution Networks Under N - 1 Disruptions: A Multistage Stochastic Programming Approach. INFORMS J. Comput. 34(2): 690-709 (2022) - [i20]Cheng Guo, Harsha Nagarajan, Merve Bodur:
Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem. CoRR abs/2212.12097 (2022) - 2021
- [j7]Kaarthik Sundar, Harsha Nagarajan, Jeff T. Linderoth, Site Wang, Russell Bent:
Piecewise polyhedral formulations for a multilinear term. Oper. Res. Lett. 49(1): 144-149 (2021) - 2020
- [j6]Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent, Harsha Nagarajan:
Communication-Constrained Expansion Planning for Resilient Distribution Systems. INFORMS J. Comput. 32(4): 968-985 (2020) - [j5]Manuel Garcia, Harsha Nagarajan, Ross Baldick:
Generalized Convex Hull Pricing for the AC Optimal Power Flow Problem. IEEE Trans. Control. Netw. Syst. 7(3): 1500-1510 (2020) - [i19]Kaarthik Sundar, Harsha Nagarajan, Site Wang, Jeff T. Linderoth, Russell Bent:
Piecewise Polyhedral Formulations for a Multilinear Term. CoRR abs/2001.00514 (2020) - [i18]Minseok Ryu, Harsha Nagarajan, Russell Bent:
Algorithms for Mitigating the Effect of Uncertain Geomagnetic Disturbances in Electric Grids. CoRR abs/2006.02461 (2020)
2010 – 2019
- 2019
- [j4]Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent, Kaarthik Sundar:
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. J. Glob. Optim. 74(4): 639-675 (2019) - [j3]Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty. IEEE Trans. Control. Netw. Syst. 6(3): 1062-1074 (2019) - [c12]Siddharth Bhela, Deepjyoti Deka, Harsha Nagarajan, Vassilis Kekatos:
Designing Power Grid Topologies for Minimizing Network Disturbances: An Exact MILP Formulation. ACC 2019: 1949-1956 - [c11]Carleton Coffrin, Harsha Nagarajan, Russell Bent:
Evaluating Ising Processing Units with Integer Programming. CPAIOR 2019: 163-181 - [i17]Mowen Lu, Sandra D. Eksioglu, Scott J. Mason, Russell Bent, Harsha Nagarajan:
Distributionally Robust Optimization for a Resilient Transmission Grid During Geomagnetic Disturbances. CoRR abs/1906.04139 (2019) - 2018
- [j2]Kaarthik Sundar, Carleton Coffrin, Harsha Nagarajan, Russell Bent:
Probabilistic N-k failure-identification for power systems. Networks 71(3): 302-321 (2018) - [j1]Sreenath Chalil Madathil, Emre Yamangil, Harsha Nagarajan, Arthur K. Barnes, Russell Bent, Scott Backhaus, Scott J. Mason, Salman Mashayekh, Michael Stadler:
Resilient Off-Grid Microgrids: Capacity Planning and N-1 Security. IEEE Trans. Smart Grid 9(6): 6511-6521 (2018) - [c10]Ole Kröger, Carleton Coffrin, Hassan L. Hijazi, Harsha Nagarajan:
Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia. CPAIOR 2018: 377-386 - [c9]Mohammad Rasoul Narimani, Daniel K. Molzahn, Harsha Nagarajan, Mariesa L. Crow:
Comparison of Various Trilinear Monomial Envelopes for Convex Relaxations of Optimal Power Flow Problems. GlobalSIP 2018: 865-869 - [i16]Mowen Lu, Harsha Nagarajan, Russell Bent, Sandra D. Eksioglu, Scott J. Mason:
Tight Piecewise Convex Relaxations for Global Optimization of Optimal Power Flow. CoRR abs/1803.04633 (2018) - [i15]Sai Krishna Kanth Hari, Kaarthik Sundar, Harsha Nagarajan, Russell Bent, Scott Backhaus:
Hierarchical Predictive Control Algorithms for Optimal Design and Operation of Microgrids. CoRR abs/1803.06705 (2018) - [i14]Harsha Nagarajan, Kaarthik Sundar, Hassan L. Hijazi, Russell Bent:
Convex Hull Formulations for Mixed-Integer Multilinear Functions. CoRR abs/1807.11007 (2018) - [i13]Kaarthik Sundar, Harsha Nagarajan, Sidhant Misra, Mowen Lu, Carleton Coffrin, Russell Bent:
Optimization-Based Bound Tightening using a Strengthened QC-Relaxation of the Optimal Power Flow Problem. CoRR abs/1809.04565 (2018) - 2017
- [c8]Harsha Nagarajan, Prabhakar R. Pagilla, Swaroop Darbha, Russell Bent, Pramod P. Khargonekar:
Optimal configurations to minimize disturbance propagation in manufacturing networks. ACC 2017: 2213-2218 - [c7]Deepjyoti Deka, Harsha Nagarajan, Scott Backhaus:
Optimal topology design for disturbance minimization in power grids. ACC 2017: 2719-2724 - [c6]Fei Wu, Harsha Nagarajan, Anatoly Zlotnik, Ramteen Sioshansi, Aleksandr M. Rudkevich:
Adaptive convex relaxations for Gas Pipeline Network Optimization. ACC 2017: 4710-4716 - [i12]Mowen Lu, Harsha Nagarajan, Emre Yamangil, Russell Bent, Scott Backhaus:
Optimal Transmission Line Switching under Geomagnetic Disturbances. CoRR abs/1701.01469 (2017) - [i11]Deepjyoti Deka, Harsha Nagarajan, Scott Backhaus:
Optimal Topology Design for Disturbance Minimization in Power Grids. CoRR abs/1703.00558 (2017) - [i10]Kaarthik Sundar, Harsha Nagarajan, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
A Modified Benders Decomposition for Chance-Constrained Unit Commitment with N-1 Security and Wind Uncertainty. CoRR abs/1703.05206 (2017) - [i9]Harsha Nagarajan, Russell Bent, Pascal Van Hentenryck, Scott Backhaus, Emre Yamangil:
Resilient Transmission Grid Design: AC Relaxation vs. DC approximation. CoRR abs/1703.05893 (2017) - [i8]Kaarthik Sundar, Carleton Coffrin, Harsha Nagarajan, Russell Bent:
Probabilistic Interdiction for Power Systems. CoRR abs/1704.05391 (2017) - [i7]Arthur K. Barnes, Harsha Nagarajan, Emre Yamangil, Russell Bent, Scott Backhaus:
Tools for improving resilience of electric distribution systems with networked microgrids. CoRR abs/1705.08229 (2017) - [i6]Carleton Coffrin, Harsha Nagarajan, Russell Bent:
Ising Processing Units: Potential and Challenges for Discrete Optimization. CoRR abs/1707.00355 (2017) - [i5]Harsha Nagarajan, Mowen Lu, Site Wang, Russell Bent, Kaarthik Sundar:
An Adaptive, Multivariate Partitioning Algorithm for Global Optimization of Nonconvex Programs. CoRR abs/1707.02514 (2017) - 2016
- [c5]Harsha Nagarajan, Mowen Lu, Emre Yamangil, Russell Bent:
Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning. CP 2016: 369-387 - [c4]Harsha Nagarajan, Emre Yamangil, Russell Bent, Pascal Van Hentenryck, Scott Backhaus:
Optimal Resilient transmission Grid Design. PSCC 2016: 1-7 - [c3]Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
Unit commitment with N-1 Security and wind uncertainty. PSCC 2016: 1-7 - [i4]Kaarthik Sundar, Harsha Nagarajan, Miles Lubin, Line Roald, Sidhant Misra, Russell Bent, Daniel Bienstock:
Unit Commitment with N-1 Security and Wind Uncertainty. CoRR abs/1602.00079 (2016) - [i3]Harsha Nagarajan, Mowen Lu, Emre Yamangil, Russell Bent:
Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning. CoRR abs/1606.05806 (2016) - 2015
- [c2]Harsha Nagarajan, Sivakumar Rathinam, Swaroop Darbha:
On maximizing algebraic connectivity of networks for various engineering applications. ECC 2015: 1626-1632 - 2012
- [c1]Harsha Nagarajan, Sivakumar Rathinam, Swaroop Darbha, K. R. Rajagopal:
Synthesizing robust communication networks for UAVs. ACC 2012: 3730-3735 - [i2]K. B. Nakshatrala, Harsha Nagarajan:
A numerical methodology for enforcing maximum principles and the non-negative constraint for transient diffusion equations. CoRR abs/1206.0701 (2012) - 2010
- [i1]Harsha Nagarajan, K. B. Nakshatrala:
Enforcing non-negativity constraint and maximum principles for diffusion with decay on general computational grids. CoRR abs/1003.5257 (2010)
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-10-17 21:27 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:
