SDP-based bounds for the quadratic cycle cover problem via cutting-plane augmented Lagrangian methods and reinforcement learning
Year of publication: |
2021
|
---|---|
Authors: | Meijer, Frank de ; Sotirov, Renata |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 4, p. 1262-1276
|
Subject: | cutting-plane method | Dykstra’s projection algorithm | facial reduction | quadratic cycle cover problem | reinforcement learning | semidefinite programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Lernen | Learning | Algorithmus | Algorithm | Lernprozess | Learning process |
-
Learning to steer nonlinear interior-point methods
Kuhlmann, Renke, (2019)
-
Double Deep Q-Learning for optimal execution
Ning, Brian, (2021)
-
Wu, Yuting, (2024)
- More ...
-
Partitioning through projections : strong SDP bounds for large graph partition problems
Meijer, Frank de, (2023)
-
Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization
Meijer, Frank de, (2023)
-
Salahi, Maziar, (2004)
- More ...