Note: A note on a polynomial time solvable case of the quadratic assignment problem

Authors:
GüNeş ErdoğAn;Barbaros Tansel
Affiliations:
Bilkent University, Department of Industrial Engineering, 06800 Bilkent, Ankara, Turkey;Bilkent University, Department of Industrial Engineering, 06800 Bilkent, Ankara, Turkey
Venue:
Discrete Optimization
Year:
2006

Citing 3
Cited 1

Introduction to algorithms

Introduction to algorithms
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
A solvable case of the quadratic assignment problem11This research has been supported by the Spezialforschungsbereich F 003 ``Optimierung und Kontrolle", Projektbereich Diskrete Optimierung.

Operations Research Letters

An O(n4) Algorithm for the QAP Linearization Problem

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify a class of instances of the Koopmans-Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.