SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning |
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
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
0 references
0 references
0 references
0 references
0 references
0 references
