Minimum energy configurations on a toric lattice as a quadratic assignment problem
Work
Year: 2020
Type: article
Abstract: We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds we... more
Source: Discrete Optimization
Authors Daniel Brosch, Etienne de Klerk
Institution Tilburg University
Cites: 34
Cited by: 1
Related to: 10
FWCI: 0.341
Citation percentile (by year/subfield): 62.78
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Affordable and clean energy
Open Access status: hybrid
APC paid (est): $2,560