MAQO: A Scalable Many-Core Annealer for Quadratic Optimization on a Stratix 10 FPGA
Abstract
Index Terms
- MAQO: A Scalable Many-Core Annealer for Quadratic Optimization on a Stratix 10 FPGA
Recommendations
A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
Recent progress in solving quadratic assignment problems QAPs from the QAPLIB Quadratic Assignment Problem Library test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite ...
An algorithm for the generalized quadratic assignment problem
This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a broad class of quadratic integer programming problems, wherein M pair-wise related entities are assigned to N destinations ...
A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in