RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2025 Volume 65, Number 7, Pages 1110–1117 (Mi zvmmf12007)

General numerical methods

Symmetric triangular decomposition for constructing approximations to solving the quadratic assignment problem

I. E. Kaporin

Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow

Abstract: The permutation matrices that arise in the process of triangular decomposition of shifted symmetric matrices with the choice of the maximum modulo leading element on the diagonal are used as initial approximations for a series of elementary permutations that improve the target value of the quadratic assignment problem. The results of testing the proposed method on 128 test tasks from QAPLIB are presented.

Key words: quadratic assignment problem, symmetrical triangular decomposition, complete selection of the leading element on the diagonal.

UDC: 519.612

Received: 20.03.2025
Accepted: 23.04.2025

DOI: 10.31857/S0044466925070043


 English version:
Computational Mathematics and Mathematical Physics, 2025, 65:7, 1487–1494

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026