{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T01:41:29Z","timestamp":1717724489955},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007455","name":"Skolkovo Institute of Science and Technology","doi-asserted-by":"crossref","award":["1075-MRA"],"id":[{"id":"10.13039\/501100007455","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC52-06NA25396"],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10601-016-9253-y","type":"journal-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T01:59:59Z","timestamp":1473731999000},"page":"24-49","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Graphical models for optimal power flow"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-1328-4677","authenticated-orcid":false,"given":"Krishnamurthy","family":"Dvijotham","sequence":"first","affiliation":[]},{"given":"Michael","family":"Chertkov","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Vuffray","sequence":"additional","affiliation":[]},{"given":"Sidhant","family":"Misra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"issue":"1","key":"9253_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341.","journal-title":"Mathematical Programming Computation"},{"issue":"1","key":"9253_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/61.19265","volume":"4","author":"ME Baran","year":"1989","unstructured":"Baran, M. E., & Wu, F. F. (1989). Optimal capacitor placement on radial distribution systems. IEEE Transactions on Power Delivery, 4(1), 725\u2013734.","journal-title":"IEEE Transactions on Power Delivery"},{"key":"9253_CR3","unstructured":"Bienstock, D., & Munoz, G. (2015). LP approximations to mixed-integer polynomial optimization problems ArXiv e-prints."},{"key":"9253_CR4","unstructured":"Bienstock, D., & Verma, A. (2015). Strong NP-hardness of AC power flows feasibility. arXiv:\n http:\/\/arXiv.org\/abs\/1512.07315\n \n ."},{"issue":"2","key":"9253_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L. T., Conn, A. R., Cornu\u00e9jols, G., Grossmann, I. E., Laird, C. D., & Lee, J., Lodi, A., Margot, F., Sawaya, N., et al. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186\u2013204.","journal-title":"Discrete Optimization"},{"issue":"3","key":"9253_CR6","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TCNS.2015.2401172","volume":"2","author":"S Bose","year":"2015","unstructured":"Bose, S., Gayme, D., Chandy, K., & Low, S. (2015). Quadratically constrained quadratic programs on acyclic graphs with application to power flow. IEEE Transactions on Control of Network Systems, 2(3), 278\u2013287. doi:\n http:\/\/dx.doi.org\/10.1109\/TCNS.2015.2401172\n \n .","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"8","key":"9253_CR7","first-page":"431","volume":"3","author":"J Carpentier","year":"1962","unstructured":"Carpentier, J. (1962). Contribution to the economic dispatch problem. Bulletin de la Soci\u00e9t\u00e9 Fran\u00e7aise des Electriciens, 3(8), 431\u2013447.","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Fran\u00e7aise des Electriciens"},{"key":"9253_CR8","unstructured":"Coffrin, C., Hijazi, H. L., & Van Hentenryck, P. (2015). Strengthening convex relaxations with bound tightening for power network optimization. In Principles and Practice of Constraint Programming (pp. 39\u201357): Springer."},{"key":"9253_CR9","unstructured":"Dechter, R. (2003). Constraint processing."},{"key":"9253_CR10","unstructured":"Dunning, I., Huchette, J., & Lubin, M. (2015). JuMP: A modeling language for mathematical optimization. arXiv:\n 1508.01982\n \n [math.OC]."},{"issue":"2","key":"9253_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/opre.1110.1025","volume":"60","author":"D Gamarnik","year":"2012","unstructured":"Gamarnik, D., Shah, D., & Wei, Y. (2012). Belief propagation for min-cost network flow: Convergence and correctness. Operations Research, 60(2), 410\u2013428.","journal-title":"Operations Research"},{"issue":"1","key":"9253_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/TAC.2014.2332712","volume":"60","author":"L Gan","year":"2015","unstructured":"Gan, L., Li, N., Topcu, U., & Low, S. H. (2015). Exact convex relaxation of optimal power flow in radial networks. IEEE Transactions on Automatic Control, 60 (1), 72\u201387.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"9253_CR13","unstructured":"Johnson, J. K. (2008). Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches. Ph.D. thesis Massachusetts Institute of Technology."},{"key":"9253_CR14","unstructured":"Kakade, S. M., Kearns, M., & Ortiz, L. E. (2004). Graphical economics. In International Conference on Computational Learning Theory (pp. 17\u201332): Springer."},{"key":"9253_CR15","unstructured":"Kearns, M., Littman, M. L., & Singh, S. (2001). Graphical models for game theory. In Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (pp. 253\u2013260): Morgan Kaufmann Publishers Inc."},{"key":"9253_CR16","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: principles and techniques: MIT Press."},{"issue":"2","key":"9253_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F. R., Frey, B. J., & Loeliger, H. A. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 498\u2013519.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9253_CR18","doi-asserted-by":"crossref","unstructured":"Lavaei, J., Tse, D., & Zhang, B. (2013). Geometry of power flows and optimization in distribution networks.","DOI":"10.1109\/PESGM.2012.6344803"},{"issue":"1","key":"9253_CR19","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1109\/TPWRS.2015.2407363","volume":"31","author":"K Lehmann","year":"2016","unstructured":"Lehmann, K., Grastien, A., & Van Hentenryck, P. (2016). AC-feasibility on tree networks is NP-hard. IEEE Transactions on Power Systems, 31(1), 798\u2013801. doi:\n 10.1109\/TPWRS.2015.2407363\n \n .","journal-title":"IEEE Transactions on Power Systems"},{"key":"9253_CR20","unstructured":"Low, S. H. (2014). Convex relaxation of optimal power flow, part i: Formulations and equivalence. arXiv preprint arXiv:\n 1405.0766\n \n ."},{"key":"9253_CR21","doi-asserted-by":"crossref","unstructured":"Low, S. H. (2014). Convex Relaxation of Optimal Power Flow, Part II: Exactness. ArXiv eprints.","DOI":"10.1109\/TCNS.2014.2323634"},{"key":"9253_CR22","unstructured":"Ortiz, L. E. (2014). On sparse discretization for graphical games. arXiv:\n 1411.3320\n \n ."},{"key":"9253_CR23","unstructured":"Ortiz, L. E., & Irfan, M. T. (2016). FPTAS for mixed-strategy nash equilibria in tree graphical games and their generalizations. arXiv:\n 1602.05237\n \n ."},{"key":"9253_CR24","volume-title":"Computer techniques in power system analysis","author":"M Pai","year":"2014","unstructured":"Pai, M., & Chatterjee, D. (2014). Computer techniques in power system analysis. India: McGraw-Hill Education."},{"issue":"4","key":"9253_CR25","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1137\/130915261","volume":"24","author":"S Sojoudi","year":"2014","unstructured":"Sojoudi, S., & Lavaei, J. (2014). Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure. SIAM Journal on Optimization, 24(4), 1746\u20131778.","journal-title":"SIAM Journal on Optimization"},{"key":"9253_CR26","unstructured":"Sontag, D. A. (2010). Approximate inference in graphical models using LP relaxations: Ph.D. thesis Massachusetts Institute of Technology."},{"key":"9253_CR27","doi-asserted-by":"crossref","unstructured":"Vigerske, S., & Gleixner, A. (2016). SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework.","DOI":"10.1080\/10556788.2017.1335312"},{"key":"9253_CR28","unstructured":"Vittal, V., & Bergen, A. R. (1999). Power systems analysis: Prentice Hall."},{"issue":"1-2","key":"9253_CR29","first-page":"1","volume":"1","author":"MJ Wainwright","year":"2008","unstructured":"Wainwright, M. J., & Jordan, M. I. (2008). Graphical models, exponential families, and variational inference. Foundations and Trends\n ${\\circledR }$ \n in Machine Learning, 1(1-2), 1\u2013305.","journal-title":"Foundations and Trends${\\circledR }$\u24c7 in Machine Learning"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9253-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9253-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9253-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T14:58:16Z","timestamp":1589727496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9253-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,13]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9253"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9253-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,13]]},"assertion":[{"value":"13 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}