Structural Properties of Linearized Power Flows and Power Grid Design

[1]  Francisco D. Galiana,et al.  A survey of the optimal power flow literature , 1991 .

[2]  W. T. Tutte On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[3]  S. Binato,et al.  Power transmission network design by greedy randomized adaptive path relinking , 2005, IEEE Transactions on Power Systems.

[4]  V. Vittal,et al.  A Mixed-Integer Linear Programming Approach for Multi-Stage Security-Constrained Transmission Expansion Planning , 2012, IEEE Transactions on Power Systems.

[5]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Hans-Jürgen Haubrich,et al.  Integrierte Grundsatz- und Ausbauplanung für Hochspannungsnetze , 2004 .

[8]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[9]  Andreas Grothey,et al.  MILP formulation for controlled islanding of power networks , 2013 .

[10]  Antonio J. Conejo,et al.  Transmission expansion planning: a mixed-integer LP approach , 2003 .

[11]  J. Salmeron,et al.  Analysis of electric grid security under terrorist threat , 2004, IEEE Transactions on Power Systems.

[12]  R. Belmans,et al.  Usefulness of DC power flow for active power flow analysis , 2005, IEEE Power Engineering Society General Meeting, 2005.

[13]  A.H. Escobar,et al.  Transmission network expansion planning considering uncertainty in generation and demand , 2008, 2008 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America.

[14]  Alexander Martin,et al.  Mixed integer linear models for the optimization of dynamical transport networks , 2011, Math. Methods Oper. Res..

[15]  V. Vittal,et al.  Transmission expansion planning using an ac model: Formulations and possible relaxations , 2012, 2012 IEEE Power and Energy Society General Meeting.

[16]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[17]  Laura Bahiense,et al.  A Mixed Integer Disjunctive Model for Transmission Network Expansion , 2001 .

[18]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[19]  Grisselle Centeno,et al.  Stochastic optimization for power system configuration with renewable energy in remote areas , 2013, Ann. Oper. Res..

[20]  Hans-Jürgen Haubrich,et al.  Strategische Ausbauplanung für elektrische Netze unter Unsicherheit , 2007 .

[21]  Kory W. Hedman,et al.  A model and approach to the challenge posed by optimal power systems planning , 2013, Math. Program..

[22]  Michael R. Bussieck,et al.  MINLP Solver Software , 2011 .

[23]  M. Morris,et al.  The Design , 1998 .

[24]  K. I. M. McKinnon,et al.  Optimization-Based Islanding of Power Networks Using Piecewise Linear AC Power Flow , 2013, IEEE Transactions on Power Systems.

[25]  A. Vannelli,et al.  Formulation of Oligopolistic Competition in AC Power Networks: An NLP Approach , 2007, IEEE Transactions on Power Systems.

[26]  Giulia Galbiati Approximating Minimum Cut with Bounded Size , 2011, INOC.

[27]  Jim Hefferon,et al.  Linear Algebra , 2012 .

[28]  S. Salon,et al.  Transmission Network Planning Using Linear Programming , 1985, IEEE Transactions on Power Apparatus and Systems.

[29]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[30]  O. Alsaç,et al.  DC Power Flow Revisited , 2009, IEEE Transactions on Power Systems.

[31]  L. Kiepert Ueber die Auflösung der Gleichungen fünften Grades , 1878 .

[32]  S. Low,et al.  Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.

[33]  R. Prim Shortest connection networks and some generalizations , 1957 .

[34]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[35]  W. T. Tutte Graph Theory , 1984 .

[36]  Clyde L. Monma,et al.  On the Computational Complexity of Integer Programming Problems , 1978 .

[37]  M.J. Rider,et al.  Transmission Network Expansion Planning Considering Uncertainty in Demand , 2006, IEEE Transactions on Power Systems.

[38]  Xiaohu Tao,et al.  Automatisierte Grundsatzplanung von Mittelspannungsnetzen , 2006 .

[39]  M. F. Pereira,et al.  A Decomposition Approach To Automated Generation/Transmission Expansion Planning , 1985, IEEE Transactions on Power Apparatus and Systems.

[40]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[41]  Long Zhao,et al.  An Exact Algorithm for Power Grid Interdiction Problem with Line Switching , 2012 .

[42]  Markus Merkel,et al.  On a base exchange game on bispanning graphs , 2014, Discret. Appl. Math..

[43]  Jizhong Zhu,et al.  Optimization of Power System Operation , 2009 .

[44]  Matthias Baumgart,et al.  Ranking and ordering problems of spanning trees , 2009 .

[45]  Antonio Sassano,et al.  Metric Inequalities and the Network Loading Problem , 2004, IPCO.

[46]  S. Binato,et al.  Transmission network expansion planning under a Tabu Search approach , 2001 .

[47]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[48]  L. S. Moulin,et al.  Transmission expansion planning with re-design , 2010 .

[49]  Pascal Van Hentenryck,et al.  A Linear-Programming Approximation of AC Power Flows , 2012, INFORMS J. Comput..

[50]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[51]  Daniel Bienstock,et al.  Using mixed-integer programming to solve power grid blackout problems , 2007, Discret. Optim..

[52]  M. El-Kady Computer-Aided Planning of Distribution Substation and Primary Feeders , 1984, IEEE Transactions on Power Apparatus and Systems.

[53]  Takao Nishizeki,et al.  Spanning Distribution Trees of Graphs , 2013, FAW-AAIM.

[54]  David Coudert,et al.  Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks , 2014, INFORMS J. Comput..

[55]  Paul A. Trodden,et al.  Local Solutions of the Optimal Power Flow Problem , 2013, IEEE Transactions on Power Systems.

[56]  Robert G. Jeroslow,et al.  There Cannot be any Algorithm for Integer Programming with Quadratic Constraints , 1973, Oper. Res..

[57]  Manuel Kutschka Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty , 2014, OR.

[58]  L. L. Garver,et al.  Transmission Network Estimation Using Linear Programming , 1970 .

[59]  G. Nemhauser,et al.  Integer Programming , 2020 .

[60]  R. Bent,et al.  Approximating line losses and apparent power in AC power flow linearizations , 2012, 2012 IEEE Power and Energy Society General Meeting.

[61]  Paul A. Tipler,et al.  Physik für Wissenschaftler und Ingenieure , 2015 .

[62]  G.T. Heydt,et al.  Slow-Coherency-Based Controlled Islanding—A Demonstration of the Approach on the August 14, 2003 Blackout Scenario , 2006, IEEE Transactions on Power Systems.

[63]  D. Bienstock,et al.  The N − k Problem in Power Grids : New Models , Formulations and Computation , 2010 .