Graphical models for optimal power flow
暂无分享,去创建一个
Pascal Van Hentenryck | Michael Chertkov | Krishnamurthy Dvijotham | Marc Vuffray | Sidhant Misra | Krishnamurthy Dvijotham | M. Chertkov | Sidhant Misra | Marc Vuffray
[1] Daniel Bienstock,et al. LP approximations to mixed-integer polynomial optimization problems , 2015, ArXiv.
[2] Ufuk Topcu,et al. Exact Convex Relaxation of Optimal Power Flow in Radial Networks , 2013, IEEE Transactions on Automatic Control.
[3] Nir Friedman,et al. Probabilistic Graphical Models - Principles and Techniques , 2009 .
[4] M. E. Baran,et al. Optimal capacitor placement on radial distribution systems , 1989 .
[5] Tommi S. Jaakkola,et al. Approximate inference in graphical models using lp relaxations , 2010 .
[6] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[7] M. A. Pai,et al. Computer techniques in power system analysis , 2014 .
[8] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[9] K. Mani Chandy,et al. Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow , 2012, IEEE Transactions on Control of Network Systems.
[10] Steven H. Low,et al. Convex Relaxation of Optimal Power Flow—Part II: Exactness , 2014, IEEE Transactions on Control of Network Systems.
[11] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[12] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[13] Pascal Van Hentenryck,et al. AC-Feasibility on Tree Networks is NP-Hard , 2014, IEEE Transactions on Power Systems.
[14] Javad Lavaei,et al. Geometry of power flows in tree networks , 2012, 2012 IEEE Power and Energy Society General Meeting.
[15] Javad Lavaei,et al. Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure , 2014, SIAM J. Optim..
[16] Hadi Saadat,et al. Power Systems Analysis , 2002 .
[17] Devavrat Shah,et al. Belief Propagation for Min-Cost Network Flow: Convergence and Correctness , 2010, Oper. Res..
[18] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .
[19] Iain Dunning,et al. JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..
[20] Pascal Van Hentenryck,et al. Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization , 2015, CP.
[21] Devavrat Shah,et al. Belief propagation for min-cost network flow: convergence & correctness , 2010, SODA '10.
[22] Arthur R. Bergen,et al. Power Systems Analysis , 1986 .
[23] Luis E. Ortiz,et al. FPTAS for Mixed-Strategy Nash Equilibria in Tree Graphical Games and Their Generalizations , 2016, ArXiv.
[24] Jason K. Johnson,et al. Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches , 2008 .
[25] Luis E. Ortiz,et al. Graphical Economics , 2004, COLT.
[26] Ambros M. Gleixner,et al. SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework , 2018, Optim. Methods Softw..
[27] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[28] Javad Lavaei,et al. Geometry of Power Flows and Optimization in Distribution Networks , 2012, IEEE Transactions on Power Systems.
[29] Steven H. Low,et al. Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence , 2014, IEEE Transactions on Control of Network Systems.
[30] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.