A DYNAMIC-PROGRAMMING ALGORITHM FOR COVERING PROBLEMS WITH (GREEDY) TOTALLY BALANCED CONSTRAINT MATRICES

被引：12

作者：

BROIN, MW ^{[1
]}

LOWE, TJ ^{[1
]}

机构：

[1] PURDUE UNIV,KRANNERT GRAD SCH MANAGEMENT,W LAFAYETTE,IN 47907

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1986年 / 7卷 / 03期

关键词：

D O I：

10.1137/0607039

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：348 / 357

页数：10

共 11 条

[1]

Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535

[2]

Fulkerson D., 1974, PIVOTING EXTENSION, P120

[3]

GILES R, 1978, ARS COMBINATORIA, V6, P179

[4] TOTALLY-BALANCED AND GREEDY MATRICES [J].

HOFFMAN, AJ ;

KOLEN, AWJ ;

SAKAROVITCH, M .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (04) :721-730

[5]

HSU WL, 1982, OPER RES LETT, V1, P96

[6] A GENERAL ALGORITHM FOR THE OPTIMAL DISTRIBUTION OF EFFORT [J].

KARUSH, W .

MANAGEMENT SCIENCE, 1962, 9 (01) :50-72

[7] SOLVING COVERING PROBLEMS AND THE UNCAPACITATED PLANT LOCATION PROBLEM ON TREES [J].

KOLEN, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (03) :266-278

[8]

KOLEN A, 1982, THESIS AMSTERDAM

[9]

KOLEN AWJ, UNPUB DISCRETE LOCAT

[10] THE MAXIMUM COVERAGE LOCATION PROBLEM [J].

MEGIDDO, N ;

ZEMEL, E ;

HAKIMI, SL .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (02) :253-261

← 1 2 →