ANALYSIS OF APPROXIMATIONS FOR MAXIMIZING SUBMODULAR SET FUNCTIONS .1.

被引：2787

作者：

NEMHAUSER, GL ^{[1
]}

WOLSEY, LA ^{[1
]}

FISHER, ML ^{[1
]}

机构：

[1] UNIV PENN,PHILADELPHIA,PA 19174

来源：

关键词：

D O I：

10.1007/BF01588971

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：265 / 294

页数：30

共 9 条

[1]

Babayev D. A., 1974, Mathematical Programming, V7, P249, DOI 10.1007/BF01585522

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, 1968, MATH DECISION SCI, V11, P333

[5]

Edmonds J., 1971, COMBINATORIAL STRUCT, P69

[6]

Frieze A. M., 1974, Mathematical Programming, V7, P245, DOI 10.1007/BF01585521

[7]

Shapley LS., 1962, NAVAL RES LOGISTIC Q, V9, P45, DOI [10.1002/nav.3800090106, DOI 10.1002/NAV.3800090106]

[8] PLANT LOCATION WITH GENERALIZED SEARCH ORIGIN [J].

SPIELBERG, K .

MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (03) :165-178

[9]

WOODALL DR, 1973 BRIT COMB C AB