THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION

被引：95

作者：

CURRENT, JR ^{[1
]}

VELLE, CSR ^{[1
]}

COHON, JL ^{[1
]}

机构：

[1] JOHNS HOPKINS UNIV,BALTIMORE,MD 21218

来源：

关键词：

D O I：

10.1016/0377-2217(85)90030-X

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：189 / 199

页数：11

共 27 条

[1] BICRITERIA TRANSPORTATION PROBLEM [J].

ANEJA, YP ;

NAIR, KPK .

[2]

BALINSKI M, 1969, PROGRAM OPERATIONS R

[3] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

[4]

Bradley G. H., 1975, AIIE Transactions, V7, P222, DOI 10.1080/05695557508975006

[5]

Church R., 1974, PAP SCI, V32, P101, DOI DOI 10.1007/BF01942293

[6]

Cohon J., 1978, MULTIOBJECTIVE PROGR

[7]

CURRENT J, 1983, CAS WPS837 OH STAT U

[8]

CURRENT J, 1982, OPERATIONS RES GROUP

[9]

Current JR, 1981, THESIS J HOPKINS U B

[10]

DENEUFVILLE R, 1973, TRANSPORT RES, V7, P63