Journal: Networks

Volume 21, Issue 7

705 -- 712Chengen Yang, Dayong Jin. A primal-dual algorithm for the minimum average weighted length circuit problem
713 -- 745Shiow C. Lin, Eva Ma. Sensitivity analysis of 0-1 multiterminal network flows
747 -- 765Robert A. Russell, Dave Gribbin. A multiphase approach to the period routing problem
767 -- 773Veena Adlakha, Barbara Gladysz, Jerzy Kamburowski. t) planar networks
775 -- 798Christos Alexopoulos, George S. Fishman. Characterizing stochastic flow networks using the monte carlo method

Volume 21, Issue 6

595 -- 617David Avis, Michel Deza. 1 embeddability, complexity, and multicommodity flows
619 -- 643John M. Mulvey, Hercules Vladimirou. Solving multistage stochastic networks: An application of scenario aggregation
645 -- 666Hiroshi Nagamochi, Toshihide Ibaraki. Maximum flows in probabilistic networks
667 -- 687Agha Iqbal Ali, Chung-Hsing Huang. Balanced spanning forests and trees
689 -- 704Do Ba Khang, Okitsugu Fujiwara. Approximate solutions of capacitated fixed-charge minimum cost network flow problems

Volume 21, Issue 5

487 -- 503Jeffrey B. Sidney, Stuart J. Sidney, A. Warburton. Average properties of two-dimensional partial orders
505 -- 520Dan Gusfield, Dalit Naor. Efficient algorithms for generalized cut-trees
521 -- 545Thore Egeland, Arne Bang Huseby. On dependence and reliability computations
547 -- 563Tetsuo Ichimori, Naoki Katoh. A two-commodity sharing problem on networks
565 -- 580Yuping Qiu. Solution properties of oligopolistic network equilibria
581 -- 593Jane N. Hagstrom. Computing rooted communication reliability in an almost acyclic digraph

Volume 21, Issue 4

373 -- 385Robert J. Dawson, Abdel Aziz Farrag. Fault-tolerant extensions of star networks
387 -- 415Dvora Tzvieli. Minimal diameter double-loop networks. I. Large infinite optimal families
417 -- 419Wendy Myrvold, Kim H. Cheung, Lavon B. Page, Jo Ellen Perry. Uniformly-most reliable networks do not always exist
421 -- 455Robert C. Brigham, Ronald D. Dutton. A compilation of relations between graph invariants - supplement I
457 -- 468Lih-Hsing Hsu, Shih-Yih Wang. Maximum independent number for series-parallel networks
469 -- 485Jose A. Ventura. Computational development of a lagrangian dual approach for quadratic networks

Volume 21, Issue 3

257 -- 265Yong-Mao Chen, Prakash Ramanan. Euclidean shortest path in the presence of obstacles
267 -- 294Sang-Bang Choi, Arun K. Somani. The generalized folding-cube network
295 -- 319Ariel Orda, Raphael Rom. Minimum weight paths in time-dependent networks
321 -- 344Erick Mata-Montero. k-tree networks with edge and node failures
345 -- 357Michael O. Ball, J. Scott Provan, Douglas R. Shier. Reliability covering problems
359 -- 368Ashok T. Amin, Kyle Siegrist, Peter J. Slater. On the nonexistence of uniformly optimal graphs for pair-connected reliability
369 -- 370Gary Ulrich. Simulation methodology for statisticians, operations analysts and engineers, Vol. I, by P. A. W. Lewis and E. J. Orav, Wadsworth, Belmont, CA, 1989, 416 pp
371 -- 0Stephen G. Strickland. Stochastic modeling and the theory of queues, by R. W. WOE, Rentice Hall, Engle- wood Cliffs, NJ, 1989, 556 pp

Volume 21, Issue 2

133 -- 163Hanif D. Sherali, Thomas P. Rizzo. p-median problems on a chain graph with a continuum of link demands
165 -- 179M. L. Balinski, J. Gonzalez. Maximum matchings in bipartite graphs via strong spanning trees
181 -- 194Francis T. Boesch, Xiaoming Li, Charles L. Suffel. On the existence of uniformly optimally reliable networks
195 -- 203Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa. Polynomial time algorithms on circular-arc overlap graphs
205 -- 221Neal E. Young, Robert Endre Tarjan, James B. Orlin. Faster parametric shortest path and minimum-balance algorithms
223 -- 243Margaret L. Brandeau, Samuel S. Chiu. Parametric analysis of optimal facility locations
245 -- 255Ortrud R. Oellermann. Conditional graph connectivity relative to hereditary properties

Volume 21, Issue 1

1 -- 9Jean-Claude Bermond, Dvora Tzvieli. Minimal diameter double-loop networks: Dense optimal families
11 -- 17K. B. Reid. Centroids to centers in trees
19 -- 28Dan Gusfield. Efficient algorithms for inferring evolutionary trees
29 -- 50Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai. Shortest path algorithms using dynamic breadth-first search
51 -- 89Sunil Chopra, M. R. Rao. On the multiway cut polyhedron
91 -- 107Janusz A. Brzozowski, T. Gahlinger, Farhad Mavaddat. Consistency and satisfiability of waveform timing specifications
109 -- 132Anna Nagurney, Lan Zhao. A network equilibrium formulation of market disequilibrium and variational inequalities