AN EFFICIENT LABELING TECHNIQUE FOR SOLVING SPARSE ASSIGNMENT PROBLEMS

被引：5

作者：

DERIGS, U ^{[1
]}

METZ, A ^{[1
]}

机构：

[1] UNIV BONN,INST OKONOMETRIE & OPERAT RES,D-5300 BONN 1,FED REP GER

来源：

COMPUTING | 1986年 / 36卷 / 04期

关键词：

D O I：

10.1007/BF02240205

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：301 / 311

页数：11

共 11 条

[1] A PRIMAL METHOD FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS [J].

BALINSKI, ML ;

GOMORY, RE .

MANAGEMENT SCIENCE, 1964, 10 (03) :578-593

[2] SIGNATURE METHODS FOR THE ASSIGNMENT PROBLEM [J].

BALINSKI, ML .

OPERATIONS RESEARCH, 1985, 33 (03) :527-536

[3]

BURKARD R, 1984, SPRINGER LECTURE NOT, V184

[4] ALGORITHM FOR THE SOLUTION OF THE ASSIGNMENT PROBLEM FOR SPARSE MATRICES [J].

CARPANETO, G ;

TOTH, P .

COMPUTING, 1983, 31 (01) :83-94

[5]

DERIGS U, 1984, UNPUB ANN OPERATIONS

[6] SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].

DIAL, RB .

COMMUNICATIONS OF THE ACM, 1969, 12 (11) :632-&

[7]

GLOVER F, 1982, CCS430 U TEX CTR CYB

[8] SOLVING THE ASSIGNMENT PROBLEM BY RELAXATION [J].

HUNG, MS ;

ROM, WO .

OPERATIONS RESEARCH, 1980, 28 (04) :969-982

[9]

KARNEY D, 1978, CCS320 U TEX CTR CYB

[10]

Kuhn H. W., 1955, NAV RES LOG, V2, P83, DOI 10.1002/nav.3800020109

← 1 2 →