Minimum energy configurations on a toric lattice as a quadratic assignment problem
From MaRDI portal
Publication:2673239
DOI10.1016/J.DISOPT.2020.100612OpenAlexW3111898596MaRDI QIDQ2673239FDOQ2673239
Authors: Daniel Brosch, E. 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
Recommendations
- Energy minimization of repelling particles on a toric grid
- Minimizing lattice structures for Morse potential energy in two and three dimensions
- Minimizing a symmetric quasiconvex function on a two-dimensional lattice
- On the minimal energy of tetracyclic graphs
- Minimum energy triangulations for elliptic problems
- On tetracyclic graphs having minimum energies
- Minimal configurations for the Frenkel-Kontorova model on a quasicrystal
- On the incidence energy of some toroidal lattices
- Minimization of even conic functions on the two-dimensional integral lattice
- Morse potential energy minimization: Improved bounds for optimal configurations
Semidefinite programming (90C22) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Assignment Problems
- Applications of second-order cone programming
- Title not available (Why is that?)
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Toeplitz and circulant matrices: a review.
- Comparison of iterative searches for the quadratic assignment problem
- A survey for the quadratic assignment problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Solving large quadratic assignment problems on computational grids
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Relaxations of Combinatorial Problems Via Association Schemes
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Solving quadratic assignment problems using convex quadratic programming relaxations
- A New Lower Bound Via Projection 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
- Energy minimization of repelling particles on a toric grid
- Dimension reduction for semidefinite programs via Jordan algebras
Cited In (3)
Uses Software
This page was built for publication: Minimum energy configurations on a toric lattice as a quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673239)