A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique

No abstract is available for this paper.

• Publication year

  2017

• Venue

  INFORMS journal on computing

• Publication date

  2017-08-21

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/ijoc.2017.0754
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Three Ideas for the Quadratic Assignment Problem

  2012cited by this paper
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

  2012cited by this paper
• A new relaxation framework for quadratic assignment problems based on matrix splitting

  2010cited by this paper
• A survey for the quadratic assignment problem

  2007cited by this paper
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem

  2007cited by this paper
• Solving Lift-and-Project Relaxations of Binary Integer Programs

  2006cited by this paper
• Parallel Branch and Bound Algorithms on Internet Connected Workstations

  2005cited by this paper
• Solving large quadratic assignment problems on computational grids

  2002cited by this paper
• A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

  1998cited by this paper
• Solving Large Quadratic Assignment Problems in Parallel

  1997cited by this paper
• QAPLIB – A Quadratic Assignment Problem Library

  1997cited by this paper
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem

  1995cited by this paper
• A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems

  1994cited by this paper
• Parallel Asynchronous Hungarian Methods for the Assignment Problem

  1993cited by this paper
• A parallel shortest augmenting path algorithm for the assignment problem

  1991cited by this paper
• Robust taboo search for the quadratic assignment problem

  1991cited by this paper
• Parallel synchronous and asynchronous implementations of the auction algorithm

  1991cited by this paper
• Optimized synthesis of self-testable finite state machines

  1990cited by this paper
• An Experimental Comparison of Techniques for the Assignment of Facilities to Locations

  1968cited by this paper
• ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS*

  1957cited by this paper
• Assignment Problems and the Location of Economic Activities

  1957cited by this paper

• A polyhedral characterization of linearizable quadratic combinatorial optimization problems

  2025cites this paper
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique

  2024cites this paper
• An LP-based characterization of solvable QAP instances with chess-board and graded structures

  2023cites this paper
• A GPU Accelerated Dual-Ascent Algorithm for the Multidimensional Assignment Problem in a Multitarget Tracking Application

  2023cites this paper
• Exploring Airline Gate-Scheduling Optimization Using Quantum Computers

  2021cites this paper
• A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem

  2021cites this paper
• A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems

  2020cites this paper
• Level 2 Reformulation Linearization Technique-Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters

  2019cites this paper
• Review on the Methods to Solve Combinatorial Optimization Problems Particularly: Quadratic Assignment Model

  2018cites this paper
• A comprehensive review of quadratic assignment problem: variants, hybrids and applications

  2018cites this paper
• RLT2-based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters

  2017cites this paper