EXACT SOLUTION OF CREW SCHEDULING PROBLEMS USING THE SET PARTITIONING MODEL - RECENT SUCCESSFUL APPLICATIONS

被引：82

作者：

MARSTEN, RE ^{[1
]}

SHEPARDSON, F ^{[1
]}

机构：

[1] STANFORD UNIV,GRAD SCH AUDIOL & SPEECH PATHOL,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1002/net.3230110208

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：165 / 177

页数：13

共 23 条

[1] Arabeyre J.P., 1969, TRANSPORTATION SCI, V3, P140, DOI 10.1287/trsc.3.2.140
[2] BAKER EK, 1979, AIIE T, P79
[3] CUKIER A, TRIP COMPUTER PROGRA
[4] SET-COVERING PROBLEM - NEW IMPLICIT ENUMERATION ALGORITHM
ETCHEBERRY, J
[J]. OPERATIONS RESEARCH, 1977, 25 (05) : 760 - 772
[5] FISHER ML, 1975, MATHEMATICAL PROGRAM, V3, P56
[6] SET-PARTITIONING PROBLEM - SET COVERING WITH EQUALITY CONSTRAINTS
GARFINKEL, RS
NEMHAUSER, GL
[J]. OPERATIONS RESEARCH, 1969, 17 (05) : 848 - +
[7] GARFINKEL RS, 1972, PERSPECTIVES OPTIMIZ
[8] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[9] GERBRACHT R, CAPS COMPUTER PROGRA
[10] GERBRACHT RJ, 1978, 18TH AGIFORS S VANC