Journal: Networks

Volume 14, Issue 4

489 -- 505R. Johnson. Network reliability and acyclic orientations
507 -- 513Andrea S. LaPaugh, Christos H. Papadimitriou. The even-path problem for graphs and digraphs
515 -- 530Azuma Ohuchi, Ikuo Kaji. Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
531 -- 544D. Ronen, Yehoshua Perl. Heuristics for finding a maximum number of disjoint bounded paths
545 -- 565Jacques Desrosiers, François Soumis, Martin Desrochers. Routing with time windows by column generation
567 -- 570Jane N. Hagstrom. Note on independence of arcs in antiparallel for network flow problems
571 -- 586Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie. Hierarchical vehicle routing problems
587 -- 596Harilaos N. Psaraftis. On the practical importance of asymptotic optimality in certain heuristic algorithms
597 -- 0Edward Minieka. Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95
597 -- 598Yoshi Ikura. Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95

Volume 14, Issue 3

367 -- 377Pedro G. Gazmuri. Independent sets in random sparse graphs
379 -- 391Marjory J. Johnson. Updating routing tables after resource failure in a distributed computer network
393 -- 410Der-Tsai Lee, Franco P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers
411 -- 426Ward Whitt. The amount of overtaking in a network of queues
427 -- 438Jong-Shi Pang, Chang Sung Yu. Linearized simplicial decomposition methods for computing traffic equilibria on networks
439 -- 456Malachy Carey, Chris Hendrickson. Bounds on expected performance of networks with links subject to failure
457 -- 487Bruce Hajek, Richard G. Ogier. Optimal dynamic routing in communication networks with continuous traffic

Volume 14, Issue 2

181 -- 212James A. Storer. On minimal-node-cost planar embeddings
213 -- 224A. Itai, D. K. Pradhan. Synthesis of directed multicommodity flow networks
225 -- 235Refael Hassin. On multicommodity flows in planar graphs
237 -- 256Nicos Christofides, J. E. Beasley. The period routing problem
257 -- 267Stefano Pallottino. Shortest-path methods: Complexity, interrelations and new propositions
269 -- 273Alberto Garcia-Diaz, Donald K. Friesen, Donald J. Bagert. Sorting algorithms for the implementation of a generalized vector product
275 -- 323Narsingh Deo, Chi-Yin Pang. Shortest-path algorithms: Taxonomy and annotation
325 -- 336J. W. Suurballe, Robert Endre Tarjan. A quick method for finding shortest pairs of disjoint paths
337 -- 354Qi-Mei He. An extremal problem on the connectivity of graphs
355 -- 366Abdol-Hossein Esfahanian, S. Louis Hakimi. On computing the connectivities of graphs and digraphs

Volume 14, Issue 1

1 -- 24Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong. On the np-completeness of certain network testing problems
25 -- 36Fred Glover, Randy Glover, Darwin Klingman. Computational study of an improved shortest path algorithm
37 -- 45Maciej M. Syslo. On the computational complexity of the minimum-dummy-activities problem in a pert network
47 -- 61Derek Smith. Graphs with the smallest number of minimum cut sets
63 -- 74Ulrich Schumacher. k-connected graph with minimum number of edges and quasiminimal diameter
75 -- 81Jong-Shi Pang, Chang Sung Yu. A special spatial equilibrium problem
83 -- 94Grant A. Cheston. On-line connectivity algorithms
95 -- 116Jeffrey M. Jaffe. Algorithms for finding paths with multiple constraints
117 -- 139Chen-Ching Liu, Felix F. Wu. a generalized network flow model with application to power supply-demand problems
141 -- 146Louis Caccetta. Vulnerability of communication networks
147 -- 159J. E. Beasley. An algorithm for the steiner problem in graphs
161 -- 172Gilbert Laporte, Martin Desrochers, Yves Nobert. Two exact algorithms for the distance-constrained vehicle routing problem
173 -- 0Francis T. Boesch. Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback)
174 -- 175Maurice Queyranne. Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95
176 -- 177John A. Mallick. Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95
177 -- 178George Steiner. Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50
178 -- 179Noel 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