Selected topics on assignment problems

被引：84

作者：

Burkard, RE ^{[1
]}

机构：

[1] Graz Univ Technol, Inst Math, A-8010 Graz, Austria

来源：

DISCRETE APPLIED MATHEMATICS | 2002年 / 123卷 / 1-3期

关键词：

assignment problem; bottleneck assignment problem; multidimensional assignment problem; quadratic assignment problem; special cases; asymptotic theory; quadratic bottleneck assignment problem; biquadratic assignment problem; communication assignment problem;

D O I：

10.1016/S0166-218X(01)00343-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We survey recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignment problems, in particular lower bounds, special cases and asymptotic results, biquadratic and communication assignment problems. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

收藏

页码：257 / 302

页数：46

相关论文

共 153 条

[1] A TIGHT LINEARIZATION AND AN ALGORITHM FOR ZERO-ONE QUADRATIC-PROGRAMMING PROBLEMS [J].

ADAMS, WP ;

SHERALI, HD .

MANAGEMENT SCIENCE, 1986, 32 (10) :1274-1290

[2] LINEARIZATION STRATEGIES FOR A CLASS OF ZERO-ONE MIXED INTEGER PROGRAMMING-PROBLEMS [J].

ADAMS, WP ;

SHERALI, HD .

OPERATIONS RESEARCH, 1990, 38 (02) :217-226

[3]

ADAMS WP, 1994, DIMACS SERIES DISCRE, V16, P43

[4] A greedy genetic algorithm for the quadratic assignment problem [J].

Ahuja, RK ;

Orlin, JB ;

Tiwari, A .

COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) :917-934

[5] COMPUTING A MAXIMUM CARDINALITY MATCHING IN A BIPARTITE GRAPH IN TIME O(N1.5-SQUARE-ROOT-M/LOG N) [J].

ALT, H ;

BLUM, N ;

MEHLHORN, K ;

PAUL, M .

INFORMATION PROCESSING LETTERS, 1991, 37 (04) :237-240

[6] A new rounding procedure for the assignment problem with applications to dense graph arrangement problems [J].

Arora, S ;

Frieze, A ;

Kaplan, H .

37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, :21-30

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

ASSAD, AA ;

XU, WX .

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

[8] TRAFFIC ASSIGNMENT IN COMMUNICATION SATELLITES [J].

BALAS, E ;

LANDWEER, PR .

OPERATIONS RESEARCH LETTERS, 1983, 2 (04) :141-147

[9] AN ALGORITHM FOR THE 3-INDEX ASSIGNMENT PROBLEM [J].

BALAS, E ;

SALTZMAN, MJ .

OPERATIONS RESEARCH, 1991, 39 (01) :150-161

[10] LINEAR-TIME SEPARATION ALGORITHMS FOR THE 3-INDEX ASSIGNMENT POLYTOPE [J].

BALAS, E ;

QI, LQ .

DISCRETE APPLIED MATHEMATICS, 1993, 43 (01) :1-12

← 1 2 3 4 5 6 7 8 9 10 →