{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:24:26Z","timestamp":1764937466597,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,18]]},"DOI":"10.1109\/ijcnn55064.2022.9891912","type":"proceedings-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T15:56:04Z","timestamp":1664553364000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF"],"prefix":"10.1109","author":[{"given":"Charly","family":"Alizadeh","sequence":"first","affiliation":[{"name":"Léonard de Vinci Pôle Universitaire, Research Center,Paris La Défense,France,92916"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pegah","family":"Alizadeh","sequence":"additional","affiliation":[{"name":"LIPN, UMR CNRS 7030, Université Sorbonne Paris Nord,Villetaneuse,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[{"name":"University of Edinburgh,Edinburgh,United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"Letocart","sequence":"additional","affiliation":[{"name":"LIPN, UMR CNRS 7030, Université Sorbonne Paris Nord,Villetaneuse,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emiliano","family":"Traversi","sequence":"additional","affiliation":[{"name":"LIPN, UMR CNRS 7030, Université Sorbonne Paris Nord,Villetaneuse,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2011.2170772"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2014.2320819"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2407363"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00973-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2013.2258044"},{"journal-title":"MOSEK Mosek Optimization Software","year":"2019","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0351-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"ref4","first-page":"431","article-title":"Contribution to the economic dispatch problem","volume":"3","author":"carpentier","year":"1962","journal-title":"Bulletin de la Societe Francaise des Electriciens"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.08.009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366218"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-019-09427-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483274"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-004-1084-3","article-title":"Maximum cardinality search for computing minimal triangulations of graphs","volume":"39","author":"anne","year":"2004","journal-title":"Algorithmica"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894278952"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1137\/0134014","article-title":"Algorithmic aspects of vertex elimination on directed graphs","volume":"34","author":"j","year":"1978","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2020.3044501"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/2400000006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2051168"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"event":{"name":"2022 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2022,7,18]]},"location":"Padua, Italy","end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9891857\/9889787\/09891912.pdf?arnumber=9891912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T21:27:06Z","timestamp":1667510826000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9891912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ijcnn55064.2022.9891912","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}