SOLVING LARGE-SCALE MATCHING PROBLEMS EFFICIENTLY - A NEW PRIMAL MATCHING APPROACH

[1] A MATCHING BASED HEURISTIC FOR SCHEDULING MASS TRANSIT CREWS AND VEHICLES [J]. TRANSPORTATION SCIENCE, 1983, 17 (01) : 4 - 31

[2] AN ANALYSIS OF ALTERNATIVE STRATEGIES FOR IMPLEMENTING MATCHING ALGORITHMS [J]. NETWORKS, 1983, 13 (04) : 517 - 549

[3] BURKARD RE, 1980, SPRINGER LECTURE NOT, V184

[4] CUNNINGHAM WH, 1978, MATH PROGRAM STUD, V8, P50, DOI 10.1007/BFb0121194

[5] A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS [J]. NETWORKS, 1981, 11 (04) : 379 - 390

[6] DERIGS U, 1985, METHOD OPER RES, V49, P215

[7] DERIGS U, PROGRAMMING NETWORKS

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[9] EDMONDS J, 1974, LECT NOTES MATH, V411, P214

[10] GROTSCHEL M, UNPUB MATH PAPER

[1] A MATCHING BASED HEURISTIC FOR SCHEDULING MASS TRANSIT CREWS AND VEHICLES [J]. TRANSPORTATION SCIENCE, 1983, 17 (01) : 4 - 31

[2] AN ANALYSIS OF ALTERNATIVE STRATEGIES FOR IMPLEMENTING MATCHING ALGORITHMS [J]. NETWORKS, 1983, 13 (04) : 517 - 549

[3] BURKARD RE, 1980, SPRINGER LECTURE NOT, V184

[4] CUNNINGHAM WH, 1978, MATH PROGRAM STUD, V8, P50, DOI 10.1007/BFb0121194

[5] A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS [J]. NETWORKS, 1981, 11 (04) : 379 - 390

[6] DERIGS U, 1985, METHOD OPER RES, V49, P215

[7] DERIGS U, PROGRAMMING NETWORKS

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +

[9] EDMONDS J, 1974, LECT NOTES MATH, V411, P214

[10] GROTSCHEL M, UNPUB MATH PAPER