SUBMODULAR SET-FUNCTIONS, MATROIDS AND THE GREEDY ALGORITHM - TIGHT WORST-CASE BOUNDS AND SOME GENERALIZATIONS OF THE RADO-EDMONDS THEOREM

被引：248

作者：

CONFORTI, M

CORNUEJOLS, G

机构：

[1] CATHOLIC UNIV LOUVAIN,CORE,B-1200 BRUSSELS,BELGIUM

[2] CARNEGIE MELLON UNIV,GRAD SCH IND ADM,PITTSBURGH,PA 15213

来源：

关键词：

D O I：

10.1016/0166-218X(84)90003-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：251 / 274

页数：24

共 12 条

[1]

Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233

CORNUEJOLS, G ;

FISHER, ML ;

NEMHAUSER, GL .

[3]

Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]

[4]

EDMONDS J, 1970, COMBINATORIAL STRUCT, P68

[5]

FISHER ML, 1978, MATH PROGRAM STUD, V8, P73, DOI 10.1007/BFb0121195

[6]

JENKYNS TA, 1976, 7TH P SE C COMB GRAP, P341

[7]

Korte B., 1978, ANN DISCRETE MATH, V2, P65, DOI DOI 10.1016/S0167-5060(08)70322-4

[8]

KREPS DM, 1978, REPRESENTATION THEOR

[9]

Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.1090/S0002-9939-1956-0078686-7, DOI 10.1090/S0002-9939-1956-0078686-7, 10.2307/2033241]

[10]

Lawler E.L., 1976, COMBINATORIAL OPTIMI