首页> 外文期刊>Journal of Mathematical Modelling and Algorithms >Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices
【24h】

Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices

机译:单调和双单调矩阵的二次分配问题的可解决问题

获取原文
获取原文并翻译 | 示例
       

摘要

Conditions imposed on the matrices of the Quadratic Assignment Problem (QAP) are derived such that an optimum of the QAP is attained on a given permutation. These conditions describe four new sets of matrices, which, in the general case, are not anti-Monge and Toeplitz matrices that were used for most of the known well solvable special cases of the QAP.
机译:得出施加在二次分配问题(QAP)矩阵上的条件,以便在给定的排列上获得QAP的最优值。这些条件描述了四个新的矩阵集,在一般情况下,它们不是用于QAP的大多数已知可很好解决的特殊情况的反Monge和Toeplitz矩阵。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号