The following pages link to Frank de Meijer (Q2175053):
Displaying 11 items.
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning (Q6348662) (← links)
- Exploiting Symmetries in Optimal Quantum Circuit Design (Q6517562) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6519713) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6614182) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
- Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem (Q6747662) (← links)
- Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms (Q6763855) (← links)
