暂无分享,去创建一个
Carleton Coffrin | Bernard Knueven | Marc Vuffray | Jesse Holzer | Jesse T. Holzer | Carleton Coffrin | Bernard Knueven | Marc Vuffray
[1] Selmer M. Johnson,et al. A Linear Programming Approach to the Chemical Equilibrium Problem , 1958 .
[2] R. Jabr. Radial distribution load flow using conic programming , 2006, IEEE Transactions on Power Systems.
[3] Yonghong Chen,et al. MIP formulation improvement for large scale security constrained unit commitment with configuration based combined cycle modeling , 2017 .
[4] James R. Luedtke,et al. Locally ideal formulations for piecewise linear functions with indicator variables , 2013, Oper. Res. Lett..
[5] Pascal Van Hentenryck,et al. AC-Feasibility on Tree Networks is NP-Hard , 2014, IEEE Transactions on Power Systems.
[6] Sean P. Meyn,et al. An Extreme-Point Subdifferential Method for Convex Hull Pricing in Energy and Reserve Markets—Part I: Algorithm Structure , 2013, IEEE Transactions on Power Systems.
[7] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..
[8] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[9] Xingwang Ma,et al. MISO Unlocks Billions in Savings Through the Application of Operations Research for Energy and Ancillary Services Markets , 2012, Interfaces.
[10] Ian A. Hiskens,et al. A Survey of Relaxations and Approximations of the Power Flow Equations , 2019, Foundations and Trends® in Electric Energy Systems.
[11] Ian A. Hiskens,et al. Moment-based relaxation of the optimal power flow problem , 2013, 2014 Power Systems Computation Conference.
[12] L. L. Garver,et al. Power Generation Scheduling by Integer Programming-Development of Theory , 1962, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.
[13] Jean-Paul Watson,et al. On Mixed-Integer Programming Formulations for the Unit Commitment Problem , 2020, INFORMS J. Comput..
[14] C. Gentile,et al. Tighter Approximated MILP Formulations for Unit Commitment Problems , 2009, IEEE Transactions on Power Systems.
[15] Claudio Gentile,et al. Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints , 2006, Oper. Res..
[16] Robert Fourer,et al. A simplex algorithm for piecewise-linear programming III: Computational analysis and applications , 1992, Math. Program..
[17] J. Ho. Relationships among linear formulations of separable convex piecewise linear programs , 1985 .
[18] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[19] Pascal Van Hentenryck,et al. A Linear-Programming Approximation of AC Power Flows , 2012, INFORMS J. Comput..
[20] Carleton Coffrin,et al. The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow , 2017, IEEE Transactions on Power Systems.
[21] Pascal Van Hentenryck,et al. Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization , 2015, CP.
[22] Russell Bent,et al. An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs , 2017, J. Glob. Optim..
[23] George B. Dantzig,et al. RECENT ADVANCES IN LINEAR PROGRAMMING , 1956 .
[24] Pascal Van Hentenryck,et al. Network flow and copper plate relaxations for AC transmission systems , 2015, 2016 Power Systems Computation Conference (PSCC).
[25] Abhinav Verma,et al. Power grid security analysis: an optimization approach , 2010 .
[26] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[27] Leo Liberti,et al. Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..
[28] Arun Majumdar,et al. Advanced Research Projects Agency ‐ Energy , 2010 .
[29] Iain Dunning,et al. JuMP: A Modeling Language for Mathematical Optimization , 2015, SIAM Rev..
[30] J. Lavaei,et al. Physics of power networks makes hard optimization problems easy to solve , 2012, 2012 IEEE Power and Energy Society General Meeting.
[31] G. Dantzig. ON THE SIGNIFICANCE OF SOLVING LINEAR PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES , 1960 .
[32] Russell Bent,et al. PowerModels.J1: An Open-Source Framework for Exploring Power Flow Formulations , 2017, 2018 Power Systems Computation Conference (PSCC).
[33] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[34] Daniel K. Molzahn,et al. Moment/Sum-of-Squares Hierarchy for Complex Polynomial Optimization , 2015, 1508.02068.
[35] Renke Huang,et al. The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms , 2019, ArXiv.
[36] Antonio Frangioni,et al. New MINLP Formulations for the Unit Commitment Problems with Ramping Constraints , 2019 .
[37] 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.
[38] Nikolaos V. Sahinidis,et al. A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..
[39] Jorge Nocedal,et al. Knitro: An Integrated Package for Nonlinear Optimization , 2006 .
[40] O. Alsaç,et al. DC Power Flow Revisited , 2009, IEEE Transactions on Power Systems.
[41] Abraham Charnes,et al. Minimization of non-linear separable convex functionals† , 1954 .
[42] Paul A. Trodden,et al. Local Solutions of the Optimal Power Flow Problem , 2013, IEEE Transactions on Power Systems.
[43] George L. Nemhauser,et al. Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..