default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 11
Volume 11, Number 1, Spring 1981
- Doris R. Ryan, Stephen Chen:
A comparison of three algorithms for finding fundamental cycles in a directed graph. 1-12 - Charles J. Colbourn:
On testing isomorphism of permutation graphs. 13-21 - J. MacGregor Smith, D. T. Lee, Judith Liebman:
An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric. 23-39 - G. M. Weber:
Sensitivity analysis of optimal matchings. 41-56 - Frank Boesch, Frank Harary, Jerald A. Kabell:
Graphs as models of communication network vulnerability: Connectivity and persistence. 57-63 - Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. 65-68 - Jin Akiyama, Geoffrey Exoo, Frank Harary:
Covering and packing in graphs IV: Linear arboricity. 69-72 - Joseph H. Discenza:
A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges. 73-75 - Ján Plesník:
The complexity of designing a network with minimum diameter. 77-85 - Yehoshua Perl, Yaacov Yesha:
Mean flow scheduling and optimal construction of a treelike communication network. 87-92
Volume 11, Number 2, Summer 1981
- Frank Boesch:
Editorial. 93
- Bruce L. Golden, Lawrence D. Bodin:
Preface. 95-96
- Lawrence Bodin, Bruce L. Golden:
Classification in vehicle routing and scheduling. 97-108 - Marshall L. Fisher, Ramchandran Jaikumar:
A generalized assignment heuristic for vehicle routing. 109-124 - Frank H. Cullen, John J. Jarvis, H. Donald Ratliff:
Set partitioning based heuristics for interactive routing. 125-143 - Nicos Christofides, Aristide Mingozzi, Paolo Toth:
State-space relaxation procedures for the computation of bounds to routing problems. 145-164 - Roy E. Marsten, Fred Shepardson:
Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications. 165-177
- Thomas L. Magnanti:
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects. 179-213 - Michael O. Ball, Michael J. Magazine:
The design and analysis of heuristics. 215-219 - Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of vehicle routing and scheduling problems. 221-227 - Linus Schrage:
Formulation and structure of more complex/realistic routing and scheduling problems. 229-232
Volume 11, Number 3
- Peter J. Slater:
The k-nucleus of a graph. 233-242 - Refael Hassin:
Generalizations of Hoffman's existence theorem for circulations. 243-254 - Arthur M. Farley:
Networks immune to isolated failures. 255-268 - Doron Rotem, Jorge Urrutia:
Finding maximum cliques in circle graphs. 269-278 - Roger H. Lamprey, Bruce H. Barnes:
A new concept of primeness in graphs. 279-284 - Richard C. Larson, Victor O. K. Li:
Finding minimum rectilinear distance paths in the presence of barriers. 285-304 - Bruce L. Golden, Richard T. Wong
:
Capacitated arc routing problems. 305-315 - Satoru Fujishige:
A note on the problem of updating shortest paths. 317-319
- Clyde L. Monma:
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75. 321-322
Volume 11, Number 4, Winter 1981
- Arnon Rosenthal:
Series-parallel reduction for difficult measures of network reliability. 323-334 - Howard A. Smolleck, Mo-Shing Chen:
A new approach to near-optimal path assignment through electric-circuit modeling. 335-349 - Edward Minieka:
A polynomial time algorithm for finding the absolute center of a network. 351-355 - A. Satyanarayana, Jane N. Hagstrom:
Combinatorial properties of directed graphs useful in computing network reliability. 357-366 - Michael Florian, Sang Nguyen, Stefano Pallottino:
A dual simplex algorithm for finding all shortest paths. 367-378 - Ulrich Derigs:
A shortest augmenting path method for solving minimal perfect matching problems. 379-390 - Norman Zadeh:
On the elimination of negative cost arcs in flow problems. 391-392 - Edward J. Anderson:
Mazes: Search games on unknown networks. 393-397 - Aaron Kershenbaum:
A note on finding shortest path trees. 399-400 - Franklin H. Moss, Philip M. Merlin:
Some theoretical results in multiple path definition in networks. 401-411
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
