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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Lernprozess | Learning process |
-
A strengthened Barvinok-Pataki bound on SDP rank
Im, Jiyoung, (2021)
-
On boundedness of Q-learning iterates for stochastic shortest path problems
Yu, Huizhen, (2013)
-
Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes
Yaakoubi, Yassine, (2022)
- 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)
-
On semidefinite programming relaxations of the traveling salesman problem
Klerk, Etienne de, (2008)
- More ...