Frank de Meijer

According to our database, Frank de Meijer authored at least 8 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Spanning and splitting: Integer semidefinite programming for the quadratic minimum spanning tree problem.

Frank de Meijer, Melanie Siebenhofer, Renata Sotirov, Angelika Wiegele

Eur. J. Oper. Res., 2026

Exploiting symmetries in optimal quantum circuit design.

Frank de Meijer, Dion Gijswijt, Renata Sotirov

Discret. Optim., 2026

2025

The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization.

Frank de Meijer, Renata Sotirov

Math. Program., January, 2025

2024

On Integrality in Semidefinite Programming for Discrete Optimization.

Frank de Meijer, Renata Sotirov

SIAM J. Optim., March, 2024

Automorphism Groups of Cayley Graphs Generated by General Transposition Sets.

Dion Gijswijt, Frank de Meijer

Electron. J. Comb., 2024

2023

Partitioning through projections: Strong SDP bounds for large graph partition problems.

Frank de Meijer, Renata Sotirov, Angelika Wiegele, Shudian Zhao

Comput. Oper. Res., 2023

2021

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

Frank de Meijer, Renata Sotirov

INFORMS J. Comput., 2021

2020

The quadratic cycle cover problem: special cases and efficient bounds.

Frank de Meijer, Renata Sotirov

J. Comb. Optim., 2020