A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
From MaRDI portal
Publication:5131697
DOI10.1287/IJOC.2017.0754OpenAlexW2746585819MaRDI QIDQ5131697FDOQ5131697
Authors: Alexandre Domingues Gonçalves, Artur Alves Pessoa, C. Bentes, Lúcia Maria de A. Drummond, Ricardo L. S. Farias 
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2017.0754
Cites Work
- QAPLIB - a quadratic assignment problem library
- Assignment Problems and the Location of Economic Activities
- Algorithms for the Assignment and Transportation Problems
- A survey for the quadratic assignment problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Three Ideas for the Quadratic Assignment Problem
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A parallel shortest augmenting path algorithm for the assignment problem
- Solving large quadratic assignment problems in parallel
- Parallel synchronous and asynchronous implementations of the auction algorithm
- Parallel Asynchronous Hungarian Methods for the Assignment Problem
Cited In (3)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
Uses Software
This page was built for publication: A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131697)
