THE HIERARCHICAL NETWORK DESIGN PROBLEM

被引：74

作者：

CURRENT, JR ^{[1
]}

REVELLE, CS ^{[1
]}

COHON, JL ^{[1
]}

机构：

[1] JOHNS HOPKINS UNIV,BALTIMORE,MD 21218

来源：

关键词：

D O I：

10.1016/S0377-2217(86)80007-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：57 / 66

页数：10

共 22 条

[1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
[2] Cohon J., 1978, MULTIOBJECTIVE PROGR
[3] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY
CROWDER, H
PADBERG, MW
[J]. MANAGEMENT SCIENCE, 1980, 26 (05) : 495 - 509
[4] THE SHORTEST COVERING PATH PROBLEM - AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN
CURRENT, J
REVELLE, C
COHON, J
[J]. JOURNAL OF REGIONAL SCIENCE, 1984, 24 (02) : 161 - 183
[5] CURRENT J, 1985, REGIONAL SCI REV, V14, P11
[6] CURRENT J, 1985, WPS85 OH STAT U COLL
[7] CURRENT J, 1985, WPS8546 OH STAT U CO
[8] THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION
CURRENT, JR
VELLE, CSR
COHON, JL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 189 - 199
[9] Current JR, 1981, THESIS J HOPKINS U B
[10] SHORTEST-PATH ALGORITHMS - TAXONOMY AND ANNOTATION
DEO, N
PANG, CY
[J]. NETWORKS, 1984, 14 (02) : 275 - 323