default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 7
Volume 7, Number 1, Spring 1977
- Charles J. McCallum Jr.:
A generalized upper bounding approach to a communications network planning problem. 1-23 - Robert Endre Tarjan:
Finding optimum branchings. 25-35 - Alfred V. Aho, Michael R. Garey, Frank K. Hwang:
Rectilinear steiner trees: Efficient special-case algorithms. 37-58 - Stephen Chen, Romesh Saigal:
A primal algorithm for solving a capacitated network flow problem with additional linear constraints. 59-79 - Jeremy F. Shapiro:
A note on the primal-dual and out-of-kilter algorithms for network optimization problems. 81-88 - J. W. Male, J. C. Liebman, C. S. Orloff:
An improvement of Orloff's general routing problem. 89-92 - Brian W. Kernighan:
The mythical man-month. By Frederick P. Brooks, Jr. Addison-Wesley Publishing Company Reading, Massachusetts 1975, $6.50, 195 pages. 93-96
Volume 7, Number 2, Summer 1977
- Arnon Rosenthal, D. Frisque:
Transformations for simplifying network reliability calculations. 97-111 - Bruce L. Golden, Thomas L. Magnanti, H. Q. Nguyen:
Implementing vehicle routing algorithms. 113-148 - Bruce L. Golden, Thomas L. Magnanti:
Deterministic network optimization: A bibliography. 149-179 - F. R. K. Chung, Frank K. Hwang:
A problem on blocking probabilities in connecting networks. 185-192
Volume 7, Number 3
- A. Thesen:
Measures of the restrictiveness of project networks. 193-208 - Bruce L. Golden:
A statistical approach to the tsp. 209-225 - Nicolas Spyratos, A. Bowen:
A fast algorithm for reliability calculations in sparse networks. 227-246 - Ernest J. Cockayne, Stephen T. Hedetniemi:
Towards a theory of domination in graphs. 247-261 - M. Anciaux-Mundeleer, P. Hansen:
On kernels in strongly connected graphs. 263-266 - Egon Balas, Eitan Zemel:
Graph substitution and set packing polytopes. 267-284
- Daniel P. Heyman:
Queueing Systems, Volume 2: Computer applications. by Leonard Kleinrock John Wiley & Sons, Inc., New York 1976, 549 Pages, $24.95. 285-286 - Roger S. Pinkham:
Probabilistic methods in combinatorics. By Paul Erdös and Joel Spencer Academic Press, Inc., New York 1974, 106 Pages, $11.75. 287
Volume 7, Number 4, Winter 1977
- W. J. Blewett, T. C. Hu:
Tree decomposition algorithm for large networks. 289-296 - Richard V. Helgason, Jeffery L. Kennington:
A product form representation of the inverse of a multicommodity cycle matrix. 297-322 - F. O. Hadlock:
A shortest path algorithm for grid graphs. 323-334 - R. Chandrasekaran:
Minimal ratio spanning trees. 335-342 - Klaus Truemper:
Unimodular matrices of flow problems with additional constraints. 343-358 - Andrew W. Shogan:
Bounding distributions for a stochastic pert network. 359-381
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 2025-11-28 23:55 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:
