Minimum energy configurations on a toric lattice as a quadratic assignment problem
From MaRDI portal
Publication:2673239
DOI10.1016/j.disopt.2020.100612OpenAlexW3111898596MaRDI QIDQ2673239
Daniel Brosch, Etienne de Klerk
Publication date: 9 June 2022
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.00872
Semidefinite programming (90C22) Integer programming (90C10) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A survey for the quadratic assignment problem
- Applications of second-order cone programming
- QAPLIB - a quadratic assignment problem library
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Dimension reduction for semidefinite programs via Jordan algebras
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Relaxations of Combinatorial Problems Via Association Schemes
- Energy Minimization of Repelling Particles on a Toric Grid
- Assignment Problems
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Comparison of iterative searches for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
