https://jump.dev/JuMP.jl/stable/assets/documentercitations/citations-data.js

1// Generated by DocumenterCitations: bibliography entry data for citation hover popups.
2window.DocumenterCitationsHoverData = {"Barvinok2002":{"html":"Barvinok, A. (2002). <a href=\"https://doi.org/10.1090/gsm/054\"><em>A course in convexity<\/em><\/a>. Vol. 54 of <em>Graduate studies in mathematics<\/em> (American Mathematical Society).","page":"background/bibliography/index.html"},"BenTal2001":{"html":"Ben-Tal, A. and Nemirovski, A. (2001). <a href=\"https://doi.org/10.1137/1.9780898718829\"><em>Lectures on Modern Convex Optimization<\/em><\/a> (Society for Industrial and Applied Mathematics).","page":"background/bibliography/index.html"},"Bertsimas2018":{"html":"Bertsimas, D.; Gupta, V. and Kallus, N. (2018). <em>Data-driven robust optimization<\/em>. <a href=\"https://doi.org/10.1007/s10107-017-1125-8\">Mathematical Programming <strong>167<\/strong>, 235–292<\/a>.","page":"background/bibliography/index.html"},"Betts2010":{"html":"Betts, J. T. (2010). <a href=\"https://doi.org/10.1137/1.9780898718577\"><em>Practical Methods for Optimal Control and Estimation Using Nonlinear Programming<\/em><\/a>. Second Edition (Society for Industrial and Applied Mathematics).","page":"background/bibliography/index.html"},"Boyd2004":{"html":"Boyd, S. and Vandenberghe, L. (2004). <a href=\"https://doi.org/10.1017/CBO9780511804441\"><em>Convex Optimization<\/em><\/a> (Cambridge University Press, Cambridge).","page":"background/bibliography/index.html"},"Bukhsh2013":{"html":"Bukhsh, W. A.; Grothey, A.; McKinnon, K. I. and Trodden, P. A. (2013). <em>Local Solutions of the Optimal Power Flow Problem<\/em>. <a href=\"https://doi.org/10.1109/TPWRS.2013.2274577\">IEEE Transactions on Power Systems <strong>28<\/strong>, 4780–4788<\/a>.","page":"background/bibliography/index.html"},"Cornuejols2018":{"html":"Cornuéjols, G.; Peña, J. and Tütüncü, R. (2018). <a href=\"https://doi.org/10.1017/9781107297340\"><em>Optimization Methods in Finance<\/em><\/a>. 2 Edition (Cambridge University Press).","page":"background/bibliography/index.html"},"DAertrycke2017":{"html":"D’Aertrycke, G.; Ehrenmann, A.; Ralph, D. and Smeers, Y. (2017). <a href=\"https://doi.org/10.17863/CAM.17552\"><em>Risk trading in capacity equilibrium models<\/em><\/a> (Cambridge Working Papers in Economics (CWPE)).","page":"background/bibliography/index.html"},"Ferris2007":{"html":"Ferris, M. C.; Mangasarian, O. L. and Wright, S. J. (2007). <a href=\"https://doi.org/10.1137/1.9780898718775\"><em>Linear Programming with MATLAB<\/em><\/a> (Society for Industrial and Applied Mathematics).","page":"background/bibliography/index.html"},"Goemans1995":{"html":"Goemans, M. X. and Williamson, D. P. (1995). <em>Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming<\/em>. <a href=\"https://doi.org/10.1145/227683.227684\">J. ACM <strong>42<\/strong>, 1115–1145<\/a>.","page":"background/bibliography/index.html"},"Jabr2012":{"html":"Jabr, R. A. (2012). <em>Exploiting Sparsity in SDP Relaxations of the OPF Problem<\/em>. <a href=\"https://doi.org/10.1109/TPWRS.2011.2170772\">IEEE Transactions on Power Systems <strong>27<\/strong>, 1138–1139<\/a>.","page":"background/bibliography/index.html"},"Knuth1994":{"html":"Knuth, D. E. (1994). <em>The sandwich theorem<\/em>. <a href=\"https://doi.org/10.37236/1193\">The Electronic Journal of Combinatorics <strong>1<\/strong><\/a>.","page":"background/bibliography/index.html"},"Krasko2017":{"html":"Krasko, V. and Rebennack, S. (2017). <a href=\"https://doi.org/10.1137/1.9781611974683.ch15\"><em>Global Optimization: Optimal Power Flow Problem<\/em><\/a>. In: <em>Advances and Trends in Optimization with Engineering Applications<\/em>, edited by Terlaky, T.; Anjos, M. F. and Ahmed, S. (Society for Industrial and Applied Mathematics, Philadelphia, PA); Chapter 15, pp. 187–205.","page":"background/bibliography/index.html"},"Linial2002":{"html":"Linial, N. (2002). <a href=\"https://doi.org/10.1145/513400.513441\"><em>Finite Metric Spaces: Combinatorics, Geometry and Algorithms<\/em><\/a>. In: <em>Proceedings of the Eighteenth Annual Symposium on Computational Geometry<\/em>, <em>SCG &#39;02<\/em> (Association for Computing Machinery, New York, NY, USA); p. 63.","page":"background/bibliography/index.html"}

2,"Matousek2013":{"html":"Matoušek, J. (2013). <a href=\"https://doi.org/10.1007/978-1-4613-0039-7\"><em>Lectures on discrete geometry<\/em><\/a>. Vol. 212 no. 1 of <em>Graduate Texts in Mathematics<\/em> (Springer Science &amp; Business Media).","page":"background/bibliography/index.html"},"Peng2007":{"html":"Peng, J. and Wei, Y. (2007). <em>Approximating K‐means‐type Clustering via Semidefinite Programming<\/em>. <a href=\"https://doi.org/10.1137/050641983\">SIAM Journal on Optimization <strong>18<\/strong>, 186–205<\/a>.","page":"background/bibliography/index.html"},"RechtFazelParrilo2010":{"html":"Recht, B.; Fazel, M. and Parrilo, P. A. (2010). <a href=\"https://www.jstor.org/stable/20780168\"><em>Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization<\/em><\/a>. SIAM Review <strong>52<\/strong>, 471–501.","page":"background/bibliography/index.html"},"Zimmerman2011":{"html":"Zimmerman, R. D.; Murillo-Sánchez, C. E. and Thomas, R. J. (2011). <em>MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education<\/em>. <a href=\"https://doi.org/10.1109/TPWRS.2010.2051168\">IEEE Transactions on Power Systems <strong>26<\/strong>, 12–19<\/a>.","page":"background/bibliography/index.html"}};