SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594)

From MaRDI portal
Revision as of 08:48, 16 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7549332
Language Label Description Also known as
English
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
scientific article; zbMATH DE number 7549332

    Statements

    SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (English)
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    quadratic cycle cover problem
    0 references
    semidefinite programming
    0 references
    facial reduction
    0 references
    cutting-plane method
    0 references
    Dykstra's projection algorithm
    0 references
    reinforcement learning
    0 references

    Identifiers