A NEW LOWER BOUND FOR THE QUADRATIC ASSIGNMENT PROBLEM

被引：29

作者：

CARRARESI, P

MALUCELLI, F

机构：

来源：

OPERATIONS RESEARCH | 1992年 / 40卷

关键词：

D O I：

10.1287/opre.40.1.S22

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We introduce a new lower bound for the quadratic assignment problem based on a sequence of equilvalent formulations of the problem. We present a procedure for obtaining tight bounds by sequentially applying our approach in conjunction with the A. Assad and W. Xu bound and the N. Christofides and M. Gerrard bound.

引用

页码：S22 / S27

页数：6

共 15 条

[1] ON LOWER BOUNDS FOR A CLASS OF QUADRATIC-0, 1 PROGRAMS [J].

ASSAD, AA ;

XU, WX .

OPERATIONS RESEARCH LETTERS, 1985, 4 (04) :175-180

[2] QUADRATIC ASSIGNMENT PROBLEMS [J].

BURKARD, RE .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (03) :283-289

[3]

BURKARD RE, 1983, LOCATION SPATIAL INT

[4]

CARRARESI P, 1988, RICERCA OPERATION, V47, P3

[5]

Christofides N., 1981, Studies on graphs and discrete programming, P61

[6]

Edwards C, 1977, PROC CP77 COMBINATOR, P55

[7]

FINKE G, 1987, ANN DISCRETE MATH, V31, P61, DOI DOI 10.1016/S0304-0208(08)73232-8

[8] ON THE QUADRATIC ASSIGNMENT PROBLEM [J].

FRIEZE, AM ;

YADEGAR, J .

DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :89-98

[9]

GILMORE PC, 1962, SIAM J APPL MATH, V14, P305

[10] ASSIGNMENT PROBLEMS AND THE LOCATION OF ECONOMIC-ACTIVITIES [J].

KOOPMANS, TC ;

BECKMANN, M .

ECONOMETRICA, 1957, 25 (01) :53-76

← 1 2 →