default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 16
Volume 16, Number 1, Spring 1986
- Ulrich Derigs:
Solving large-scale matching problems efficiently: A new primal matching approach. 1-16 - Stefan Chanas, Waldemar Kolodziejczyk:
Integer flows in network with fuzzy capacity constraints. 17-31 - Gilbert Laporte, Hélène Mercure, Yves Nobert:
An exact algorithm for the asymmetrical capacitated vehicle routing problem. 33-46 - Ding-Zhu Du, Frank K. Hwang:
On a conjecture of trietsch and handler on the flow-dependent steiner ratio. 47-50 - Harry Heffes, Akhil Kumar:
Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks. 51-65 - Helmut Prodinger:
The average height of the d-th highest leaf of a planted plane tree. 67-75 - Doron Rotem, Nicola Santoro
, Jeffrey B. Sidney:
Shout echo selection in distributed files. 77-86 - Eric Howe, Charles R. Johnson, James Lawrence:
The structure of distances in networks. 87-106
- Chang-Sung Yu:
Graph theory, by W. T. Tutte, Encyclopedia of Mathematics and its Applications, Volume 21, Addison-Wesley Publishing Company, Menlo Park, CA., 1984, 333 pp. Price: 45.00. 107-108
Volume 16, Number 2, Summer 1986
- Carlos F. Daganzo, Gordon F. Newell:
Configuration of physical distribution networks. 113-132 - Douglas R. Shier, David E. Whited:
Iterative algorithms for generating minimal cutsets in directed graphs. 133-147 - Aarni Perko:
Implementation of algorithms for K shortest loopless paths. 149-160 - Marius M. Solomon:
On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. 161-174 - Terry A. McKee:
Underlying properties of oriented graphs. 175-180 - Yoji Kajitani, Shuichi Ueno:
The minimum augmentation of a directed tree to a k-edge-connected directed graph. 181-197 - Trefor Evans, Derek Smith:
Optimally reliable graphs for both edge and vertex failures. 199-204 - Alfred Iwainsky, Enrico S. Canuto, Oleg G. Taraszow, Agostino Villa:
Network decomposition for the optimization of connection structures. 205-235
- Rubin Johnson:
Introductory combinatorics, by K. P. Bogart, Pitman, Boston, 1983, 388 pp. Price: $26.95. 237
Volume 16, Number 3
- Oded Berman, David Simchi-Levi:
Minisum location of a traveling salesman. 239-254 - Vidyadhar G. Kulkarni:
Shortest paths in networks with exponentially distributed arc lengths. 255-274 - Amnon Barak, Zvi Drezner, Yuri Gurevich:
On the number of active nodes in a multicomputer system. 275-282 - Victor J. Rayward-Smith, A. Clare:
On finding steiner vertices. 283-294 - Stein W. Wallace:
Solving stochastic programs with network recourse. 295-317 - J. Yael Assous:
First-and second-order bounds on terminal reliability. 319-329 - Jeremy P. Spinrad:
The minimum dummy task problem. 331-348
Volume 16, Number 4, Winter 1986
- Elarbi Choukhmane, John Franco:
An approximation algorithm for the maximum independent set problem in cubic planar graphs. 349-356 - Pierre Hansen, Jacques-François Thisse, Richard E. Wendell:
Efficient points on a network. 357-368 - Timothy B. Brecht, Charles J. Colbourn:
Improving reliability bounds in computer networks. 369-380 - Baruch Awerbuch, Shilmon Event:
Reliable broadcast protocols in unreliable networks. 381-396 - Karen W. Pullen:
A random network model of message transmission. 397-409 - Daniel Blenstock:
An algorithm for reliability analysis of planar graphs. 411-422 - Michael B. Richey, R. Gary Parker:
On multiple steiner subgraph problems. 423-438
- Okitsugu Fujiwara:
Decision making, models and algorithms: A first course, by Saul I. Gass, John Wiley & Sons, New York, 1985, 412 pp. 439-440 - James H. King:
Or on the micro, by David Whitaker, John Wiley and Sons, New York, 1984, 197 pp. Price $19.95. 440-441 - Michael H. Schneider:
Network flows and monotropic optimization, by R. T. Rockafellar, John Wiley & Sons, New York, 616 pp. Price $44.95. 441-443 - Warren H. Lieberman:
Optimization models for planning and allocation: Text and cases in mathematical programming, by Roy D. Shapiro, John Wiley & Sons, New York, 1984, 650 pp. Price $40.95. 443-444 - John R. Current:
Discrete computational structures, second edition, By Robert R. Korfhage, Academic Press, Inc., Orlando, FI, 1984, 360 pp. Price $35.00. 444-445
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-01-03 23:17 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:
