External Links

    Journal: Networks

    Volume 10, Issue 4

    277 -- 291Douglas R. Shier, Christoph Witzgall. Arc tolerances in shortest path and network flow problems
    293 -- 309Gabriel Y. Handler, Israel Zang. A dual algorithm for the constrained shortest path problem
    311 -- 327John A. Buzacott. A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
    329 -- 350Pitu B. Mirchandani, Aissa Oudjit. Localizing 2-medians on probabilistic and deterministic tree networks
    351 -- 362Richard D. Wollmer. Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
    363 -- 370Jean-Claude Picard, H. Donald Ratliff. A cut approach to a class of quadratic integer programming problems
    371 -- 372Bruce L. Golden, Arjang A. Assad. Location on networks: Theory and algorithms, Gabriel Handler and Pitu Mirchandani, MIT Press, Cambridge, 1979, 233 pp. Price: $20.00

    Volume 10, Issue 3

    183 -- 195M. Cutler. Efficient special case algorithms for the n-line planar traveling salesman problem
    197 -- 209Andres Weintraub, Jaime Gonzalez. An algorithm for the traffic assignment problem
    211 -- 219Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi. Total domination in graphs
    221 -- 248Leonard Kleinrock, Farouk Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks
    249 -- 263K. Takamizawa, Takao Nishizeki, Nobuji Saito. An algorithm for finding a short closed spanning walk in a graph
    265 -- 272Edward Minieka. Conditional centers and medians of a graph
    273 -- 275Frank Harary, Jerald A. Kabell. Monotone sequences of graphical invariants

    Volume 10, Issue 2

    91 -- 109Paolo M. Camerini, Luigi Fratta, Francesco Maffioli. k best spanning arborescences of a network
    111 -- 127Prathima Agrawal, Melvin A. Breuer. A probabilistic model for the analysis of the routing process for circuits
    129 -- 142T. Ozawa. Realization of a symmetric terminal capacity matrix by a tree with the minimum diameter
    143 -- 152Richard M. Karp. n)
    153 -- 165Michael O. Ball. Complexity of network reliability computations
    167 -- 178Yash P. Aneja. An integer linear programming approach to the steiner problem in graphs
    179 -- 182Isao Shirakawa. Some comments on permutation layout

    Volume 10, Issue 1

    1 -- 15Donald Watson. Network methods in models of production
    17 -- 31Victor V. Masch. The cyclic method of solving the transshipment problem with an additional linear constraint
    33 -- 43Bruce E. Peterson. A cut-flow procedure for transportation network optimization
    45 -- 57Yash P. Aneja, K. P. K. Nair. Maximal expected flow in a network subject to arc failures
    59 -- 70Arthur M. Farley. Minimum-time line broadcast networks
    71 -- 78Randall R. Willie. A theorem concerning cyclic directed graphs with applications to network reliability
    79 -- 86Paul D. Seymour. Four-terminus flows
    87 -- 90Paul Erdös, Siemion Fajtlowicz, Alan J. Hoffman. Maximum degree in graphs of diameter 2
    runs on