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

来源：

关键词：

D O I：

10.1287/mnsc.36.6.674

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：674 / 688

页数：15

共 67 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

Appelgren LH, 1971, TRANSPORT SCI, V5, P64

[3]

Appelgren LH, 1969, TRANSPORT SCI, V3, P53

[4]

Arabeyre J.P., 1969, TRANSPORTATION SCI, V3, P140, DOI 10.1287/trsc.3.2.140

[5]

BALAS E, 1980, MATH PROGRAM STUD, V12, P19, DOI 10.1007/BFb0120885

[6] SET-COVERING PROBLEM .2. ALGORITHM FOR SET PARTITIONING [J].

BALAS, E ;

PADBERG, M .

[7]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

[8]

BALAS E, 1986, MSRR522 CARN U

[9]

BALAS E, 1974, MSRR351 CARN U

[10] ON INTEGER-PROGRAM FOR DELIVERY PROBLEM [J].

BALINSKI, ML ;

QUANDT, RE .