The Quadratic Assignment Problem: Theory and Algorithms

售   价:
1326.00
作      者
出  版 社
出版时间
1997年12月31日
装      帧
精装
ISBN
9780792348788
复制
页      码
304
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The quadratic assignment problem (QAP) is a classical combinatorial optimization problem with numerous applications in facility location, scheduling, manufacturing, VLSI design, statistical data analysis, etc. The QAP is an extremely hard problem from both theoretical and practical points of view: 1) The QAP is NP-hard to solve to optimality and to approximate within a constant approximation ratio, and 2) QAP instances of size larger than 22 are still considered intractable. Hence, the QAP is in effect a problem that has yet to be
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个