Startseite Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability

  • V. M. Demidenko
Veröffentlicht/Copyright: 27. Juni 2007
Veröffentlichen auch Sie bei De Gruyter Brill
Discrete Mathematics and Applications
Aus der Zeitschrift Band 17 Heft 2

For classes of additively monotone matrices and incomplete anti-Monge matrices, we describe conditions which guarantee the attainment of the optimum of the functional of the quadratic assignment problem at a given permutation. The suggested conditions generalise and unify all special cases of the quadratic assignment problems with anti-Monge and Toeplitz matrices, including the well-known theorem on a permutation of three systems proved by G. H. Hardy, J. E. Littlewood, and G. Pólya in 1926, and all known extensions of this theorem.

Published Online: 2007-06-27
Published in Print: 2007-06-19

Copyright 2007, Walter de Gruyter

Heruntergeladen am 30.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/dma.2007.011/html?lang=de
Button zum nach oben scrollen