Article
Licensed
Unlicensed
Requires Authentication
Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
-
V. M. Demidenko
Published/Copyright:
June 27, 2007
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
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Periodic properties of a simplest 2-linear shift register
- Implications of a system of linear equations over a module
- Incompatible transformations of principal ideal rings
- On a method to set up a covert channel and estimation of its tolerance for interference
- An algorithmic approach to non-self-financing hedging in a discrete-time incomplete market
Articles in the same Issue
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Periodic properties of a simplest 2-linear shift register
- Implications of a system of linear equations over a module
- Incompatible transformations of principal ideal rings
- On a method to set up a covert channel and estimation of its tolerance for interference
- An algorithmic approach to non-self-financing hedging in a discrete-time incomplete market
