-
1
-
-
0018738531
-
Optimal design gas pipeline networks
-
S. Bhaskaran and F. J. M. Salzborn, Optimal design gas pipeline networks. J Oper. Res. Soc. 30 (1979) 1041-1060.
-
(1979)
J Oper. Res. Soc.
, vol.30
, pp. 1041-1060
-
-
Bhaskaran, S.1
Salzborn, F.J.M.2
-
2
-
-
21344496113
-
Generalized M/G/ C/C state dependent queueing models and pedestrian traffic flows
-
J. Cheah and J. MacGregor Smith. Generalized M/G/ C/C state dependent queueing models and pedestrian traffic flows. QUESTA 15 (1994) 365-386.
-
(1994)
QUESTA
, vol.15
, pp. 365-386
-
-
Cheah, J.1
Macgregor Smith, J.2
-
4
-
-
0000212894
-
Minimum cost communication networks
-
E. N. Gilbert, Minimum cost communication networks. Bell. Syst. Tech. J. 46 (1967) 2209-2227.
-
(1967)
Bell. Syst. Tech. J.
, vol.46
, pp. 2209-2227
-
-
Gilbert, E.N.1
-
6
-
-
84863090748
-
Steiner tree problems
-
F. K. Hwang and D. S. Richards, Steiner tree problems. Networks 22 (1992) 55-89.
-
(1992)
Networks
, vol.22
, pp. 55-89
-
-
Hwang, F.K.1
Richards, D.S.2
-
7
-
-
0039250600
-
The shortest network with a given topology
-
to appear
-
F. K. Hwang and J. F. Weng, The shortest network with a given topology. J. Algorithms, to appear.
-
J. Algorithms
-
-
Hwang, F.K.1
Weng, J.F.2
-
8
-
-
0041029074
-
-
Working Paper. University of Cambridge
-
F. P. Kelly, Loss networks. Working Paper. University of Cambridge (1990).
-
(1990)
Loss Networks
-
-
Kelly, F.P.1
-
9
-
-
0017007520
-
Low cost drainage networks
-
D. H. Lee, Low cost drainage networks. Networks 6 (1976) 351-371.
-
(1976)
Networks
, vol.6
, pp. 351-371
-
-
Lee, D.H.1
-
10
-
-
0028423772
-
Application of state-dependent queues to pedestrian/vehicular network design
-
J. MacGregor Smith, "Application of State-Dependent Queues to Pedestrian/Vehicular Network Design." Operations Research 42 (1994) 414-427.
-
(1994)
Operations Research
, vol.42
, pp. 414-427
-
-
Macgregor Smith, J.1
-
11
-
-
0019534260
-
An O(N log N) heuristic for steiner tree problems on the Euclidean metric
-
J. MacGregor Smith, D. T. Lee, and J. S. Liebman, An O(N log N) heuristic for Steiner tree problems on the Euclidean metric. Networks 11 (1) (1981) 23-39.
-
(1981)
Networks
, vol.11
, Issue.1
, pp. 23-39
-
-
Macgregor Smith, J.1
Lee, D.T.2
Liebman, J.S.3
-
12
-
-
0019263795
-
An O( N log N) heuristic algorithm for the rectilinear Steiner minimal tree problem
-
J. MacGregor Smith, D. T. Lee, and J. S. Liebman, An O( N log N) heuristic algorithm for the rectilinear Steiner minimal tree problem. Eng. Optim. 4 (1980) 179-192.
-
(1980)
Eng. Optim.
, vol.4
, pp. 179-192
-
-
Macgregor Smith, J.1
Lee, D.T.2
Liebman, J.S.3
-
13
-
-
0026711351
-
How to find Steiner minimal trees in Euclidean d-space
-
W. Smith, How to find Steiner minimal trees in Euclidean d-space. Algorithimica 7(2/3) ( 1992) 137-177.
-
(1992)
Algorithimica
, vol.7
, Issue.2-3
, pp. 137-177
-
-
Smith, W.1
-
14
-
-
0009261812
-
Degenerate Gilbert-Steiner trees
-
J. F. Weng, Degenerate Gilbert-Steiner trees. Networks 22(4) (1992) 335-348.
-
(1992)
Networks
, vol.22
, Issue.4
, pp. 335-348
-
-
Weng, J.F.1
-
15
-
-
52449147871
-
Path-distance heuristics for the Steiner problem in undirected networks
-
P. Winter and J. MacGregor Smith. Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica 7 (1992) 309-327.
-
(1992)
Algorithmica
, vol.7
, pp. 309-327
-
-
Winter, P.1
Macgregor Smith, J.2
-
16
-
-
0001401614
-
Modeling circulation systems in buildings using state dependent queueing models
-
S. Yuhaski and J. MacGregor Smith, Modeling circulation systems in buildings using state dependent queueing models. Queue. Syst. 4 (1989) 319-338.
-
(1989)
Queue. Syst.
, vol.4
, pp. 319-338
-
-
Yuhaski, S.1
Macgregor Smith, J.2
|