AN ALGORITHM FOR SET COVERING PROBLEM

被引：188

作者：

BEASLEY, JE

机构：

[1] Imperial Coll of Science &, Technology, London, Engl, Imperial Coll of Science & Technology, London, Engl

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1987年 / 31卷 / 01期

关键词：

D O I：

10.1016/0377-2217(87)90141-X

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：85 / 93

页数：9

共 19 条

[1] EFFICIENT HEURISTIC SOLUTIONS TO AN AIRLINE CREW SCHEDULING PROBLEM [J].

BAKER, EK ;

BODIN, LD ;

FINNEGAN, WF ;

PONDER, RJ .

AIIE TRANSACTIONS, 1979, 11 (02) :79-85

[2]

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

[3]

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

[4]

BALAS E, 1979, COMBINATORIAL OPTIMI

[5] ON TRIVIAL AND BINDING CONSTRAINTS IN PROGRAMMING-PROBLEMS [J].

BOOT, JCG .

MANAGEMENT SCIENCE, 1962, 8 (04) :419-441

[6]

CRHISTOFIDES N, 1975, MANAGEMENT SCI, V21, P591

[7] ON OPTIMAL EXTRACTING FROM A MULTIPLE FILE DATA STORAGE SYSTEM - AN APPLICATION OF INTEGER PROGRAMMING [J].

DAY, RH .

OPERATIONS RESEARCH, 1965, 13 (03) :482-&

[8] SET-COVERING PROBLEM - NEW IMPLICIT ENUMERATION ALGORITHM [J].

ETCHEBERRY, J .

OPERATIONS RESEARCH, 1977, 25 (05) :760-772

[9] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].

FISHER, ML .

MANAGEMENT SCIENCE, 1981, 27 (01) :1-18

[10] AN APPLICATIONS ORIENTED GUIDE TO LAGRANGIAN-RELAXATION [J].

FISHER, ML .

INTERFACES, 1985, 15 (02) :10-21

← 1 2 →