Massively parallel tabu search for the quadratic assignment problem

DOI10.1007/BF02022999zbMath0775.90288OpenAlexW2023407477MaRDI QIDQ2367011

Jadranka Skorin-Kapov, Jaishankar Chakrapani

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02022999

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (21)

SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ A user's guide to tabu search ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ A cooperative parallel tabu search algorithm for the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements ⋮ Lower bounds for the quadratic assignment problem via triangle decompositions ⋮ Tabu search for graph partitioning ⋮ Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements ⋮ A tabu search algorithm for frequency assignment ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints ⋮ A parallel depth first search branch and bound algorithm for the quadratic assignment problem ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ Selected topics on assignment problems ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ The life span method -- a new variant of local search ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ Clustering categorical data sets using tabu search techniques ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation

Cites Work

• Unnamed Item
• A connectionist approach to the quadratic assignment problem
• Extensions of a tabu search adaptation to the quadratic assignment problem
• A study of diversification strategies for the quadratic assignment problem
• The Backboard Wiring Problem: A Placement Algorithm
• Tabu Search Applied to the Quadratic Assignment Problem
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• P-Complete Approximation Problems

This page was built for publication: Massively parallel tabu search for the quadratic assignment problem