How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF

Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart and Emiliano Traversi

Paper (2022)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Funders:	Fondation Mathématique Jacques Hadamard
Grant number:	P-2021-0019
PolyPublie URL:	https://publications.polymtl.ca/73366/
Conference Title:	International Joint Conference on Neural Networks (IJCNN 2022)
Conference Location:	Padua, Italy
Conference Date(s):	2022-07-18 - 2022-07-23
Publisher:	Institute of Electrical and Electronics Engineers
DOI:	10.1109/ijcnn55064.2022.9891912
Official URL:	https://doi.org/10.1109/ijcnn55064.2022.9891912
Date Deposited:	03 Mar 2026 13:57
Last Modified:	03 Mar 2026 13:57

Cite in APA 7:	Alizadeh, C., Alizadeh, P., Anjos, M. F., Létocart, L., & Traversi, E. (2022, July). How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF [Paper]. International Joint Conference on Neural Networks (IJCNN 2022), Padua, Italy (8 pages). https://doi.org/10.1109/ijcnn55064.2022.9891912
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only