Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters

DOI10.1287/ijoc.2018.0866OpenAlexW2974174883MaRDI QIDQ5139631

Rakesh Nagi, Ketan Date

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03732

zbMATH Keywords

branch-and-boundquadratic assignment problemparallel algorithmlinear assignment problemCUDAgraphics processing unitRLT2

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mathematical programming (90Cxx)

Related Items (2)

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP

Uses Software

• QAPLIB

Cites Work

• A survey for the quadratic assignment problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• A parallel branch and bound algorithm for the quadratic assignment problem
• On the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• QAPLIB - a quadratic assignment problem library
• Solving large quadratic assignment problems in parallel
• The quadratic assignment problem. Theory and algorithms
• Solving large quadratic assignment problems on computational grids
• Lower bounds for the quadratic assignment problem via triangle decompositions
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
• Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
• The Quadratic Assignment Problem
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
• Exact solution of emerging quadratic assignment problems
• Assignment Problems and the Location of Economic Activities
• P-Complete Approximation Problems
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters