default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 9
Volume 9, Number 1, Spring 1979
- R. Russell, W. Igo:
An assignment routing problem. 1-17 - F. R. K. Chung, Frank K. Hwang:
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter. 19-36 - R. Dionne, Michael Florian:
Exact and approximate algorithms for optimal network design. 37-59 - R. L. Smith:
Deferral strategies for a dynamic communications network. 61-87
- Bruce L. Golden:
Topics in Combinatorial Optimization. Edited By S. Rinaldi, Springer-Verlag New York, New York, 1975, $15.20, 186 Pages. 89-90 - Bruce L. Golden, Arjang A. Assad:
Optimization Algorithms for Networks and Graphs. By Edward Minieka, Marcel Dekker, Inc. New York, New York, 1978, $19.75, 356 Pages. 91-93
Volume 9, Number 2, Summer 1979
- G. Gallo, C. Sodini:
Adjacent extreme flows and application to min concave cost flow problems. 95-121 - Maciej M. Syslo:
On cycle bases of a graph. 123-132 - Jonathan Halpern:
A generalized dynamic flows problem. 133-167 - V. Balachandran:
Generalized transportation networks with stochastic demands: An operator theoretic approach. 169-184
- Charles J. McCallum Jr.:
Linear and combinatorial programming. By Katta G. Murty, John Wiley &Sons, Inc., New York, N.Y. 1976, $21.00, 567 pages. 185-186
Volume 9, Number 3, 1979
- Mukkai S. Krishnamoorthy, Narsingh Deo:
Complexity of the minimum-dummy-activities problem in a pert network. 189-194 - Douglas R. Shier:
On algorithms for finding the k shortest paths in a network. 195-214 - R. Dial, Fred W. Glover, David Karney, Darwin Klingman:
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. 215-248 - K. Onaga, Wataru Mayeda:
A boolean theory of network flows and metrics and its applications to particle transmission and clustering. 249-281
Volume 9, Number 4, Winter 1979
- Frank K. Hwang, Shen Lin:
On the construction of balanced switching networks. 283-307 - Paolo M. Camerini, Luigi Fratta, Francesco Maffioli:
A note on finding optimum branchings. 309-312 - Asthur M. Farley:
Minimal broadcast networks. 313-332 - Donald F. Stanat, Gyula A. Magó:
Minimizing maximum flows in linear graphs. 333-361 - T. A. Jenkyns:
The greedy travelling salesman's problem. 363-373 - Stephen D. Shapiro:
A stochastic petri net with applications to modelling occupancy times for concurrent task systems. 375-379
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 2026-07-15 00:51 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
