AN ANALYSIS OF ALTERNATIVE STRATEGIES FOR IMPLEMENTING MATCHING ALGORITHMS

被引：33
作者：
BALL, MO [1 ]
DERIGS, U [1 ]
机构：
[1] UNIV BONN,INST OPERAT RES,D-5300 BONN,FED REP GER
来源：
NETWORKS | 1983年 / 13卷 / 04期
关键词：
D O I：
10.1002/net.3230130406
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：517 / 549
页数：33
相关论文
共 17 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]   A MATCHING BASED HEURISTIC FOR SCHEDULING MASS TRANSIT CREWS AND VEHICLES [J].
BALL, M ;
BODIN, L ;
DIAL, R .
TRANSPORTATION SCIENCE, 1983, 17 (01) :4-31
[3]  
BALL MO, UNPUB COMPUTATIONAL
[4]  
BALL MO, UNPUB LINEAR TIME AL
[5]  
CUNNINGHAM WH, 1976, MATH PROGRAMMING STU, V8, P50
[6]   A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS [J].
DERIGS, U .
NETWORKS, 1981, 11 (04) :379-390
[7]  
DERIGS U, 1980, 2ND P DAN POL MATH P, P85
[8]  
DERIGS U, 1982, 82222OR U BONN I OK
[9]  
DERIGS U, 1981, MSS81041 U MAR COLL
[10]   MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+
12