1984 export record
dblp key:
journals/networks/Beasley84 share record
persistent URL:
John E. Beasley : An algorithm for the steiner problem in graphs. Networks 14 (1 ) : 147-159 (1984 )export record
dblp key:
journals/networks/Boesch84 share record
persistent URL:
Francis T. Boesch : Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). Networks 14 (1 ) : 173 (1984 )export record
dblp key:
journals/networks/Caccetta84 share record
persistent URL:
Louis Caccetta : Vulnerability of communication networks. Networks 14 (1 ) : 141-146 (1984 )export record
dblp key:
journals/networks/CareyH84 share record
persistent URL:
Malachy Carey , Chris Hendrickson : Bounds on expected performance of networks with links subject to failure. Networks 14 (3 ) : 439-456 (1984 )export record
dblp key:
journals/networks/Cheston84 share record
persistent URL:
Grant A. Cheston : On-line connectivity algorithms. Networks 14 (1 ) : 83-94 (1984 )export record
dblp key:
journals/networks/ChristofidesB84 share record
persistent URL:
Nicos Christofides , John E. Beasley : The period routing problem. Networks 14 (2 ) : 237-256 (1984 )share record
persistent URL:
Narsingh Deo , Chi-Yin Pang : Shortest-path algorithms: Taxonomy and annotation. Networks 14 (2 ) : 275-323 (1984 )export record
dblp key:
journals/networks/DesrosiersSD84 share record
persistent URL:
Jacques Desrosiers , François Soumis , Martin Desrochers : Routing with time windows by column generation. Networks 14 (4 ) : 545-565 (1984 )export record
dblp key:
journals/networks/EsfahanianH84 share record
persistent URL:
Abdol-Hossein Esfahanian , S. Louis Hakimi : On computing the connectivities of graphs and digraphs. Networks 14 (2 ) : 355-366 (1984 )export record
dblp key:
journals/networks/EvenGMT84 share record
persistent URL:
Shimon Even , Oded Goldreich , Shlomo Moran , Po Tong : On the np-completeness of certain network testing problems. Networks 14 (1 ) : 1-24 (1984 )export record
dblp key:
journals/networks/Garcia-DiazFB84 share record
persistent URL:
Alberto Garcia-Diaz , Donald K. Friesen , Donald J. Bagert : Sorting algorithms for the implementation of a generalized vector product. Networks 14 (2 ) : 269-273 (1984 )export record
dblp key:
journals/networks/Gazmuri84 share record
persistent URL:
Pedro G. Gazmuri : Independent sets in random sparse graphs. Networks 14 (3 ) : 367-377 (1984 )export record
dblp key:
journals/networks/GloverGK84 share record
persistent URL:
Fred W. Glover , Randy Glover , Darwin Klingman : Computational study of an improved shortest path algorithm. Networks 14 (1 ) : 25-36 (1984 )export record
dblp key:
journals/networks/Greis84 share record
persistent URL:
Noel P. Greis : Introduction to mathematical programming: Quantitative tools for decision-making, by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982, 287 pp. Price: $39.50. Networks 14 (1 ) : 178-179 (1984 )export record
dblp key:
journals/networks/Hagstrom84 share record
persistent URL:
Jane N. Hagstrom : Note on independence of arcs in antiparallel for network flow problems. Networks 14 (4 ) : 567-570 (1984 )export record
dblp key:
journals/networks/HajekO84 share record
persistent URL:
Bruce E. Hajek , Richard G. Ogier : Optimal dynamic routing in communication networks with continuous traffic. Networks 14 (3 ) : 457-487 (1984 )export record
dblp key:
journals/networks/Hassin84 share record
persistent URL:
Refael Hassin : On multicommodity flows in planar graphs. Networks 14 (2 ) : 225-235 (1984 )share record
persistent URL:
Qi-Mei He : An extremal problem on the connectivity of graphs. Networks 14 (2 ) : 337-354 (1984 )export record
dblp key:
journals/networks/Ikura84 share record
persistent URL:
Yoshi Ikura : Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95. Networks 14 (4 ) : 597-598 (1984 )export record
dblp key:
journals/networks/ItaiP84 share record
persistent URL:
A. Itai , D. K. Pradhan : Synthesis of directed multicommodity flow networks. Networks 14 (2 ) : 213-224 (1984 )export record
dblp key:
journals/networks/Jaffe84 share record
persistent URL:
Jeffrey M. Jaffe : Algorithms for finding paths with multiple constraints. Networks 14 (1 ) : 95-116 (1984 )export record
dblp key:
journals/networks/Johnson84 share record
persistent URL:
Marjory J. Johnson : Updating routing tables after resource failure in a distributed computer network. Networks 14 (3 ) : 379-391 (1984 )export record
dblp key:
journals/networks/Johnson84a share record
persistent URL:
R. Johnson : Network reliability and acyclic orientations. Networks 14 (4 ) : 489-505 (1984 )export record
dblp key:
journals/networks/LapaughP84 share record
persistent URL:
Andrea S. LaPaugh , Christos H. Papadimitriou : The even-path problem for graphs and digraphs. Networks 14 (4 ) : 507-513 (1984 )export record
dblp key:
journals/networks/LaporteDN84 share record
persistent URL:
Gilbert Laporte , Martin Desrochers , Yves Nobert : Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14 (1 ) : 161-172 (1984 )share record
persistent URL:
D. T. Lee , Franco P. Preparata : Euclidean shortest paths in the presence of rectilinear barriers. Networks 14 (3 ) : 393-410 (1984 )share record
persistent URL:
Chen-Ching Liu , Felix F. Wu : a generalized network flow model with application to power supply-demand problems. Networks 14 (1 ) : 117-139 (1984 )export record
dblp key:
journals/networks/Mallick84 share record
persistent URL:
John A. Mallick : Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95. Networks 14 (1 ) : 176-177 (1984 )export record
dblp key:
journals/networks/Minieka84 share record
persistent URL:
Edward Minieka : Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95. Networks 14 (4 ) : 597 (1984 )export record
dblp key:
journals/networks/OhuchiK84 share record
persistent URL:
Azuma Ohuchi , Ikuo Kaji : Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs. Networks 14 (4 ) : 515-530 (1984 )