Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 14
Volume 14, Number 1, Spring 1984
- Shimon Even, Oded Goldreich
, Shlomo Moran, Po Tong:
On the np-completeness of certain network testing problems. 1-24 - Fred W. Glover, Randy Glover, Darwin Klingman:
Computational study of an improved shortest path algorithm. 25-36 - Maciej M. Syslo:
On the computational complexity of the minimum-dummy-activities problem in a pert network. 37-45 - Derek Smith:
Graphs with the smallest number of minimum cut sets. 47-61 - Ulrich Schumacher:
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter. 63-74 - Jong-Shi Pang, Chang-Sung Yu:
A special spatial equilibrium problem. 75-81 - Grant A. Cheston:
On-line connectivity algorithms. 83-94 - Jeffrey M. Jaffe:
Algorithms for finding paths with multiple constraints. 95-116 - Chen-Ching Liu, Felix F. Wu:
a generalized network flow model with application to power supply-demand problems. 117-139 - Louis Caccetta:
Vulnerability of communication networks. 141-146 - John E. Beasley:
An algorithm for the steiner problem in graphs. 147-159 - Gilbert Laporte, Martin Desrochers, Yves Nobert:
Two exact algorithms for the distance-constrained vehicle routing problem. 161-172
- Francis T. Boesch:
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). 173 - Maurice Queyranne:
Dynamic programming: Models and applications, by Eric V. Denardo, Prentice-Hall, Englewood Cliffs, NJ, 1932, 227 pp. Price: $26.95. 174-175 - John A. Mallick:
Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95. 176-177 - George Steiner:
Mathematical aspects of scheduling and applications, by R. Bellman, A. O. Esogbue, and I. Nabeshima, Pergamon, London, 1982, 329 pp. Price: $19.50. 177-178 - Noel P. Greis:
Introduction to mathematical programming: Quantitative tools for decision-making, by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982, 287 pp. Price: $39.50. 178-179
Volume 14, Number 2, Summer 1984
- James A. Storer:
On minimal-node-cost planar embeddings. 181-212 - A. Itai, D. K. Pradhan:
Synthesis of directed multicommodity flow networks. 213-224 - Refael Hassin:
On multicommodity flows in planar graphs. 225-235 - Nicos Christofides, John E. Beasley:
The period routing problem. 237-256 - Stefano Pallottino:
Shortest-path methods: Complexity, interrelations and new propositions. 257-267 - Alberto Garcia-Diaz, Donald K. Friesen, Donald J. Bagert:
Sorting algorithms for the implementation of a generalized vector product. 269-273 - Narsingh Deo, Chi-Yin Pang:
Shortest-path algorithms: Taxonomy and annotation. 275-323 - J. W. Suurballe, Robert Endre Tarjan:
A quick method for finding shortest pairs of disjoint paths. 325-336 - Qi-Mei He:
An extremal problem on the connectivity of graphs. 337-354 - Abdol-Hossein Esfahanian, S. Louis Hakimi:
On computing the connectivities of graphs and digraphs. 355-366
Volume 14, Number 3
- Pedro G. Gazmuri:
Independent sets in random sparse graphs. 367-377 - Marjory J. Johnson:
Updating routing tables after resource failure in a distributed computer network. 379-391 - D. T. Lee, Franco P. Preparata:
Euclidean shortest paths in the presence of rectilinear barriers. 393-410 - Ward Whitt:
The amount of overtaking in a network of queues. 411-426 - Jong-Shi Pang, Chang-Sung Yu:
Linearized simplicial decomposition methods for computing traffic equilibria on networks. 427-438 - Malachy Carey, Chris Hendrickson:
Bounds on expected performance of networks with links subject to failure. 439-456 - Bruce E. Hajek, Richard G. Ogier:
Optimal dynamic routing in communication networks with continuous traffic. 457-487
Volume 14, Number 4, Winter 1984
- R. Johnson:
Network reliability and acyclic orientations. 489-505 - Andrea S. LaPaugh, Christos H. Papadimitriou:
The even-path problem for graphs and digraphs. 507-513 - Azuma Ohuchi, Ikuo Kaji:
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs. 515-530 - D. Ronen, Yehoshua Perl:
Heuristics for finding a maximum number of disjoint bounded paths. 531-544 - Jacques Desrosiers, François Soumis, Martin Desrochers:
Routing with time windows by column generation. 545-565 - Jane N. Hagstrom:
Note on independence of arcs in antiparallel for network flow problems. 567-570 - Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie:
Hierarchical vehicle routing problems. 571-586 - Harilaos N. Psaraftis:
On the practical importance of asymptotic optimality in certain heuristic algorithms. 587-596
- Edward Minieka:
Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95. 597 - Yoshi Ikura:
Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95. 597-598
a service of 
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-04-22 20:02 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
