A SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM

被引：107

作者：

AVIS, D

机构：

来源：

关键词：

D O I：

10.1002/net.3230130404

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：475 / 493

页数：19

共 27 条

[1]

AKL S, UNPUB NOTE EUCLIDEAN

[2]

AKL S, 1978, THESIS MCGILL U

[3] WORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEM [J].

AVIS, D .

[4]

AVIS D, 1978, CONGRESSUS NUM, V21, P65

[5]

AVIS D, UNPUB ANAL DECOMPOSI

[6]

Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]

[7]

BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[8]

Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]

[9] ALGORITHM AND AVERAGE-VALUE BOUNDS FOR ASSIGNMENT PROBLEMS [J].

DONATH, WE .

[10] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&