Graphical models for optimal power flow
- 13 September 2016
- journal article
- research article
- Published by Springer Science and Business Media LLC in Constraints
- Vol. 22 (1), 24-49
- https://doi.org/10.1007/s10601-016-9253-y
Abstract
No abstract availableKeywords
Funding Information
- Skolkovo Institute of Science and Technology (1075-MRA)
- U.S. Department of Energy (DE-AC52-06NA25396)
This publication has 14 references indexed in Scilit:
- Strengthening Convex Relaxations with Bound Tightening for Power Network OptimizationPublished by Springer Science and Business Media LLC ,2015
- AC-Feasibility on Tree Networks is NP-HardIEEE Transactions on Power Systems, 2015
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power FlowIEEE Transactions on Control of Network Systems, 2015
- Exact Convex Relaxation of Optimal Power Flow in Radial NetworksIEEE Transactions on Automatic Control, 2014
- Belief Propagation for Min-Cost Network Flow: Convergence and CorrectnessOperations Research, 2012
- SCIP: solving constraint integer programsMathematical Programming Computation, 2009
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Graphical EconomicsLecture Notes in Computer Science, 2004
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Optimal capacitor placement on radial distribution systemsIEEE Transactions on Power Delivery, 1989