WORST-CASE ANALYSIS OF GREEDY HEURISTICS FOR INTEGER PROGRAMMING WITH NONNEGATIVE DATA

被引：115

作者：

DOBSON, G ^{[1
]}

机构：

[1] STANFORD UNIV,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1287/moor.7.4.515

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：515 / 531

页数：17

共 6 条

[1] Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233
[2] Garey Michael R., 1979, COMPUTERS INTRACTABI
[3] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS
JOHNSON, DS
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278
[4] RATIO OF OPTIMAL INTEGRAL AND FRACTIONAL COVERS
LOVASZ, L
[J]. DISCRETE MATHEMATICS, 1975, 13 (04) : 383 - 390
[5] SENJU S, 1968, MANAGE SCI, V15, pB196
[6] SIMPLIFIED ALGORITHM FOR OBTAINING APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING PROBLEMS
TOYODA, Y
[J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (12): : 1417 - 1427