Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-monge matrices

Authors:
V. M. Demidenko;A. Dolgui
Affiliations:
Institute of Mathematics, National Academy of Sciences of Belarus, Minsk, Belarus;Ecole Nationale Superieure des Mines de Saint-Etienne, France
Venue:
Cybernetics and Systems Analysis
Year:
2007

Citing 1
Cited 2

Perspectives of Monge properties in optimization

Discrete Applied Mathematics

Subclasses of solvable problems from classes of combinatorial optimization problems

Cybernetics and Systems Analysis
An O(n4) Algorithm for the QAP Linearization Problem

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper describes new sufficient conditions that provide optimum to a quadratic assignment problem for a given substitution. The conditions separate out sets of matrices in the matrix space. The sets are formed by incomplete Anti-Monge matrices, which permit opposite ordering of rows and columns, and by additive monotone matrices, which are outside the class of Toeplitz matrices.