COMPREHENSIVE DESIGN OF HIGHWAY NETWORKS

被引：26

作者：

TRIETSCH, D

机构：

[1] Streamline Operations, Oakland, CA,, USA, Streamline Operations, Oakland, CA, USA

来源：

TRANSPORTATION SCIENCE | 1987年 / 21卷 / 01期

关键词：

All Open Access; Green;

D O I：

10.1287/trsc.21.1.26

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

HIGHWAY ENGINEERING

引用

收藏

页码：26 / 35

页数：10

相关论文

共 36 条

[1] BARBIER M, 1966, CAHIERS I AMENAGEMEN, P4
[2] BENAKIVA M, T SCI, V19, P38
[3] BILLHEIMER J, 1975, TRANSPORT SCI, V7, P49
[4] TRANSPORTATION RESEARCH - INTRODUCTION
BOYCE, DE
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) : 1 - 3
[5] GENERATION OF MINIMAL TREES WITH A STEINER TOPOLOGY
CHANG, SK
[J]. JOURNAL OF THE ACM, 1972, 19 (04) : 699 - &
[6] CLAUS A, 1975, STUD APPL MATH, V54, P17
[7] ON EFFICIENCY OF ALGORITHM FOR STEINER MINIMAL TREES
COCKAYNE, EJ
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) : 150 - &
[8] FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION
DANTZIG, GB
HARVEY, RP
LANSDOWNE, ZF
ROBINSON, DW
MAIER, SF
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) : 5 - 17
[9] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES
DIAL, R
GLOVER, F
KARNEY, D
KLINGMAN, D
[J]. NETWORKS, 1979, 9 (03) : 215 - 248
[10] DIONNE R, 1979, NETWORKS, V9, P35

← 1 2 3 4 →