A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
type: Item
instance of: scholarly article
title: A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
zbMATH Open document ID: 1506.90232
author: Abraham P. Punnen
author: Santosh N. Kabadi
published in: Discrete Optimization
publication date: 2018-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6920190
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: linearization
zbMATH Keywords: polynomial algorithms
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.02.003
OpenAlex ID: W1980190773
cites work: The quadratic assignment problem
cites work: Assignment Problems and the Location of Economic Activities
cites work: Special cases of the quadratic assignment problem
cites work: P-Complete Approximation Problems
cites work: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
cites work: The quadratic assignment problem. Theory and algorithms
cites work: The Distribution of Values in the Quadratic Assignment Problem
cites work: A contribution to quadratic assignment problems
cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
cites work: Another well-solvable case of the QAP: maximizing the job completion time variance
cites work: The Wiener maximum quadratic assignment problem
cites work: Room allocation: a polynomial subcase of the quadratic assignment problem
cites work: A solvable case of the quadratic assignment problem
cites work: Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
cites work: Q3059506
cites work: Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
cites work: Using well-solvable quadratic assignment problems for VLSI interconnect applications
cites work: A note on a polynomial time solvable case of the quadratic assignment problem
cites work: An \(O(n^{4})\) algorithm for the QAP linearization problem
cites work: On the maximal Wiener index and related questions
cites work: Polynomial algorithms for solving the quadratic assignment problem on networks
cites work: Dynamic programming for the quadratic assignment problem on trees
cites work: Two classes of quadratic assignment problems that are solvable as linear assignment problems
cites work: Q4775714
cites work: A survey for the quadratic assignment problem
cites work: Q3056948
cites work: Q4321548
DOI: 10.1016/J.DISOPT.2013.02.003
description: scientific article; zbMATH DE number 6920190