Graphical models for optimal power flow
From MaRDI portal
Publication:1701228
DOI10.1007/s10601-016-9253-yzbMath1387.90262arXiv1606.06512OpenAlexW2963206652MaRDI QIDQ1701228
Krishnamurthy Dvijotham, Michael Chertkov, Marc Vuffray, Sidhant Misra, Pascal Van Hentenryck
Publication date: 22 February 2018
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.06512
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- SCIP: solving constraint integer programs
- An algorithmic framework for convex mixed integer nonlinear programs
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Strong NP-hardness of AC power flows feasibility
- Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- Graphical Models, Exponential Families, and Variational Inference
- Factor graphs and the sum-product algorithm
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Learning Theory
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Graphical models for optimal power flow