| Article ID: | iaor2006597 |
| Country: | Belarus |
| Volume: | 2 |
| Start Page Number: | 60 |
| End Page Number: | 64 |
| Publication Date: | Jun 2005 |
| Journal: | Mathematical Sciences |
| Authors: | Demidenko V.M., Pratt J.-M. |
| Keywords: | programming: quadratic |
Restrictions for the input data of the quadratic assignment problem are described which guarantee that its optimum solution is achieved on a given pair of permutations. The described restrictions generalize before the obtained results of the analogous plan.