A NEW ALGORITHM FOR GENERAL MATCHING PROBLEMS USING NETWORK FLOW SUBPROBLEMS

被引：4

作者：

LESSARD, R ^{[1
]}

ROUSSEAU, JM ^{[1
]}

MINOUX, M ^{[1
]}

机构：

[1] UNIV PARIS 09,LAMSADE,F-75016 PARIS,FRANCE

来源：

关键词：

D O I：

10.1002/net.3230190406

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：459 / 479

页数：21

共 17 条

[1] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION
BALINSKI, ML
[J]. MANAGEMENT SCIENCE, 1965, 12 (03) : 253 - 313
[2] BALL M, 1981, COMPUTER SCHEDULING, V1, P255
[3] BROWN GG, 1984, MANAGE SCI, V13, P12
[4] BURKARD RE, 1980, LECTURE NOTES EC MAT, V184
[5] A SHORTEST AUGMENTING PATH METHOD FOR SOLVING MINIMAL PERFECT MATCHING PROBLEMS
DERIGS, U
[J]. NETWORKS, 1981, 11 (04) : 379 - 390
[6] ON THE USE OF OPTIMAL FRACTIONAL MATCHINGS FOR SOLVING THE (INTEGER) MATCHING PROBLEM
DERIGS, U
METZ, A
[J]. COMPUTING, 1986, 36 (03) : 263 - 270
[7] SOLVING LARGE-SCALE MATCHING PROBLEMS EFFICIENTLY - A NEW PRIMAL MATCHING APPROACH
DERIGS, U
[J]. NETWORKS, 1986, 16 (01) : 1 - 16
[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES
EDMONDS, J
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +
[9] Glover F., 1974, Networks, V4, P191, DOI 10.1002/net.3230040302
[10] Gondran M., 1984, GRAPHS ALGORITHMS