A heuristic procedure for solving the quadratic assignment problem
type: Item
instance of: scholarly article
title: A heuristic procedure for solving the quadratic assignment problem
zbMATH Open document ID: 0471.90074
DOI: 10.1016/0377-2217(82)90013-3
author: T. R. Jefferson
author: V. Sornprasit
author: Bruce A. Murtagh
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3739301
zbMATH Keywords: heuristic procedure
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: MINOS
zbMATH Keywords: hospital layout
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: 0377-2217(82)90013-3
OpenAlex ID: W1966953343
cites work: Note—On the Use of Fictitious Bounds in Tree Search Algorithms
cites work: An exact branch-and-bound procedure for the quadratic-assignment problem
cites work: Hospital Layout as a Quadratic Assignment Problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: An Algorithm for the Quadratic Assignment Problem
cites work: A Review of the Placement and Quadratic Assignment Problems
cites work: Assignment Problems and the Location of Economic Activities
cites work: The quadratic assignment problem
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Large-scale linearly constrained optimization
cites work: An Efficient Equipment-Layout Algorithm
cites work: Tree-search algorithms for quadratic assignment problems
cites work: Contributions to the quadratic assignment problem
description: scientific article; zbMATH DE number 3739301