OPTIMAL SOLUTION OF SET COVERING PARTITIONING PROBLEMS USING DUAL HEURISTICS

被引：171

作者：

FISHER, ML ^{[1
]}

KEDIA, P ^{[1
]}

机构：

[1] NORTHEASTERN UNIV, COLL BUSINESS ADM, BOSTON, MA 02115 USA

来源：

MANAGEMENT SCIENCE | 1990年 / 36卷 / 06期

关键词：

D O I：

10.1287/mnsc.36.6.674

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：674 / 688

页数：15

共 67 条

[51] ALGORITHM FOR LARGE SET PARTITIONING PROBLEMS [J].

MARSTEN, RE .

MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05) :774-787

[52] CREW PLANNING AT FLYING TIGER - A SUCCESSFUL APPLICATION OF INTEGER PROGRAMMING [J].

MARSTEN, RE ;

MULLER, MR ;

KILLION, CL .

MANAGEMENT SCIENCE, 1979, 25 (12) :1175-1183

[53] EXACT SOLUTION OF CREW SCHEDULING PROBLEMS USING THE SET PARTITIONING MODEL - RECENT SUCCESSFUL APPLICATIONS [J].

MARSTEN, RE ;

SHEPARDSON, F .

NETWORKS, 1981, 11 (02) :165-177

[54]

McCloskey J., 1957, NAVAL RES LOG QUART, V4, P183

[55] SET PARTITIONING AND CHAIN DECOMPOSITION [J].

NEMHAUSER, GL ;

TROTTER, LE ;

NAUSS, RM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (11) :1413-1423

[56] APPLICATION OF COMBINATORIAL PROGRAMMING TO A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMS [J].

PIERCE, JF .

MANAGEMENT SCIENCE, 1968, 15 (03) :191-209

[57] IMPROVED COMBINATORIAL PROGRAMMING ALGORITHMS FOR A CLASS OF ALL-ZERO-ONE INTEGER PROGRAMMING PROBLEMS [J].

PIERCE, JF ;

LASKY, JS .

MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 19 (05) :528-543

[58]

PIERCE JF, 1970, TAPPI, V53, P668

[59] ANALYSIS OF PRIVATE AND PUBLIC SECTOR LOCATION MODELS [J].

REVELLE, C ;

MARKS, D ;

LIEBMAN, JC .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (11) :692-707

[60]

SALKIN HM, 1973, ACM J, V20, P189

← 1 2 3 4 5 6 7 →