An exact branch‐and‐bound procedure for the quadratic‐assignment problem
作者:
M. S. Bazaraa,
A. N. Elshafei,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1979)
卷期:
Volume 26,
issue 1
页码: 109-121
ISSN:0028-1441
年代: 1979
DOI:10.1002/nav.3800260111
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe quadratic‐assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch‐and‐bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is pres
点击下载:
PDF
(926KB)
返 回