A NEW EXACT ALGORITHM FOR THE SOLUTION OF QUADRATIC ASSIGNMENT PROBLEMS

被引：32

作者：

MAUTOR, T

ROUCAIROL, C

机构：

[1] INRIA,DOMAINE VOLUCEAU ROCQUENCOURT,BP 105,F-78153 LE CHESNAY,FRANCE

[2] MASI,F-78153 LE CHESNAY,FRANCE

来源：

DISCRETE APPLIED MATHEMATICS | 1994年 / 55卷 / 03期

关键词：

D O I：

10.1016/0166-218X(94)90014-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The Quadratic Assignment Problem is known as a combinatorial optimization problem, which is very hard to solve exactly. A survey of recent methods for solving this problem is given. Then an exact algorithm is presented along with computational results on a variety of test problems. This algorithm obtains very good results and, for the first time to our knowledge, solves exactly problems of size up to twenty, this in less than twenty minutes.

引用

页码：281 / 293

页数：13

共 35 条

[31] COMPARISON OF COMPUTER ALGORITHMS AND VISUAL BASED METHODS FOR PLANT LAYOUT [J].