Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12532-018-0150-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Outer-product-free sets for polynomial optimization and oracle-based cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Programming Approximation of AC Power Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of MILP Techniques for the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and discretizations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong SOCP Relaxations for the Optimal Power Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.03050 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129150056 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12532-018-0150-9 / rank
 
Normal rank

Latest revision as of 07:27, 11 December 2024

scientific article
Language Label Description Also known as
English
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
scientific article

    Statements

    Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references