Journal: Networks

Volume 11, Issue 4

323 -- 334Arnon Rosenthal. Series-parallel reduction for difficult measures of network reliability
335 -- 349Howard A. Smolleck, Mo-Shing Chen. A new approach to near-optimal path assignment through electric-circuit modeling
351 -- 355Edward Minieka. A polynomial time algorithm for finding the absolute center of a network
357 -- 366A. Satyanarayana, Jane N. Hagstrom. Combinatorial properties of directed graphs useful in computing network reliability
367 -- 378M. Florian, Sang Nguyen, Stefano Pallottino. A dual simplex algorithm for finding all shortest paths
379 -- 390Ulrich Derigs. A shortest augmenting path method for solving minimal perfect matching problems
391 -- 392Norman Zadeh. On the elimination of negative cost arcs in flow problems
393 -- 397E. J. Anderson. Mazes: Search games on unknown networks
399 -- 400Aaron Kershenbaum. A note on finding shortest path trees
401 -- 411Franklin H. Moss, Philip M. Merlin. Some theoretical results in multiple path definition in networks

Volume 11, Issue 3

233 -- 242Peter J. Slater. k-nucleus of a graph
243 -- 254Refael Hassin. Generalizations of Hoffman's existence theorem for circulations
255 -- 268Arthur M. Farley. Networks immune to isolated failures
269 -- 278Doron Rotem, Julià Urrutia. Finding maximum cliques in circle graphs
279 -- 284R. H. Lamprey, B. H. Barnes. A new concept of primeness in graphs
285 -- 304Richard C. Larson, Victor O. K. Li. Finding minimum rectilinear distance paths in the presence of barriers
305 -- 315Bruce L. Golden, Richard T. Wong. Capacitated arc routing problems
317 -- 319Satoru Fujishige. A note on the problem of updating shortest paths
321 -- 322Clyde L. Monma. Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75

Volume 11, Issue 2

93 -- 0Frank Boesch. Editorial
95 -- 96Bruce L. Golden, Lawrence D. Bodin. Preface
97 -- 108Lawrence Bodin, Bruce L. Golden. Classification in vehicle routing and scheduling
109 -- 124Marshall L. Fisher, Ramchandran Jaikumar. A generalized assignment heuristic for vehicle routing
125 -- 143Frank H. Cullen, John J. Jarvis, H. Donald Ratliff. Set partitioning based heuristics for interactive routing
145 -- 164Nicos Christofides, Aristide Mingozzi, Paolo Toth. State-space relaxation procedures for the computation of bounds to routing problems
165 -- 177Roy E. Marsten, Fred Shepardson. Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications
179 -- 213T. L. Magnanti. Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
215 -- 219Michael Ball, Michael J. Magazine. The design and analysis of heuristics
221 -- 227Jan Karel Lenstra, A. H. G. Rinnooy Kan. Complexity of vehicle routing and scheduling problems
229 -- 232Linus Schrage. Formulation and structure of more complex/realistic routing and scheduling problems

Volume 11, Issue 1

1 -- 12Doris R. Ryan, Stephen Chen. A comparison of three algorithms for finding fundamental cycles in a directed graph
13 -- 21Charles J. Colbourn. On testing isomorphism of permutation graphs
23 -- 39J. MacGregor Smith, D. T. Lee, Judith Liebman. n) heuristic for steiner minimal tree problems on the euclidean metric
41 -- 56G. M. Weber. Sensitivity analysis of optimal matchings
57 -- 63Frank Boesch, Frank Harary, Jerald A. Kabell. Graphs as models of communication network vulnerability: Connectivity and persistence
65 -- 68Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell. The cohesiveness of a point of a graph
69 -- 72Jin Akiyama, Geoffrey Exoo, Frank Harary. Covering and packing in graphs IV: Linear arboricity
73 -- 75Joseph H. Discenza. A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges
77 -- 85Ján Plesník. The complexity of designing a network with minimum diameter
87 -- 92Yehoshua Perl, Yaacov Yesha. Mean flow scheduling and optimal construction of a treelike communication network