default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 13
Volume 13, Number 1, Spring 1983
- G. Igelmund, Franz Josef Radermacher:
Preselective strategies for the optimization of stochastic project networks under resource constraints. 1-28 - G. Igelmund, Franz Josef Radermacher:
Algorithmic approaches to preselective strategies for stochastic scheduling problems. 29-48 - Edward M. Reingold, Kenneth J. Supowit:
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. 49-66 - Masao Iri, Kazuo Murota, Shouichi Matsui:
Heuristics for planar minimum-weight perfect metchings. 67-92 - Donald M. Topkis:
Activity selection games and the minimum-cut problem. 93-105 - A. Satyanarayana, Mark K. Chang:
Network reliability and the factoring theorem. 107-120 - Oded Berman, Mina Rasty Rahnama:
A procedure for dispatching moving mobile servers. 121-141 - Mikio Kano, Akio Sakamoto:
Ranking the vertices of a weighted digraph using the length of forward arcs. 143-151
- Donald R. Smith:
Reversibility and stochastic networks, by Frank P. Kelly, Wiley, New York, 1979, 230 pp. Price: $50.95. 153-154 - Moshe Rozenblit:
Computer networks and distributed processing, by James Martin, Prentice-Hall, Englewood Cliffs, NJ, 1981, 562 pp. Price: $34.00. 154-155 - Yonatan Levy:
Introduction to queueing theory, 2nd ed., by Robert B. Cooper, Elsevier North Holland, New York, 1981, 347 pp. Price: $24.95. 155-156 - Richard Steinberg:
Traffic flows on transportation networks, by G. F. Newell, MIT Press, 1980, 276 pp. Price: $30.00. 156-157
Volume 13, Number 2, Summer 1983
- Joseph A. Wald, Charles J. Colbourn:
Steiner trees, partial 2-trees, and minimum IFI networks. 159-167 - Andrew W. Shogan:
Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements. 169-190 - Dan Gusfield:
A note on Arc tolerances in sparse shortest-path and network flow problems. 191-196 - James R. Evans:
A network decomposition/aggregation procedure for a class of multicommodity transportation problems. 197-205 - David W. Wall, Susan S. Owicki:
Construction of centered shortest-path trees in networks. 207-232 - Edward Minieka:
Radial location theory. 233-239 - John A. Buzacott:
A recursive algorithm for directed-graph reliability. 241-246 - Norishige Chiba, Takao Nishizeki, Nobuji Saito:
An algorithm for finding a large independent set in planar graphs. 247-252 - Michael O. Ball, J. Scott Provan:
Calculating bounds on reachability and connectedness in stochastic networks. 253-278 - Aaron Kershenbaum, Robert R. Boorstyn:
Centralized teleprocessing network design. 279-293 - Yash P. Aneja, V. Aggarwal, K. P. K. Nair:
Shortest chain subject to side constraints. 295-302
- Alexander H. G. Rinnooy Kan:
Capacity expansion - analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50. 303 - Leslie E. Trotter Jr.:
Algorithmic graph theory and perfect graphs, by Martin C. Golumbic, Academic, New York, 284 pp. Price: $34.00. 304-305 - Satya Chakrabarti:
Communication control in computer networks, by Josef Puzman and Radoslav Porizek, Wiley, New York, 1980, 296 pp. Price: $39.50. 305-306 - Satya Chakrabarti:
Computer networks, by Andrew S. Tanenbaum, Prentice-Hall, Englewood Cliffs, New Jersey, 1981, 517 pp. Price: $28.00. 307-308 - Robert Fourer:
Advanced linear programming: Computation and practice, by Bruce A. Murtagh, McGraw-Hill, New York, 1981, 202 pp. Price: $39.50. 308-310 - Jeffrey B. Sidney:
Sequencing and scheduling-an introduction to the mathematics of the job-shop, by Simon French, Wiley, 1982, 245 pp. Price: $49.95. 310-311 - Douglas R. Miller:
Matrix-geometric solutions in stochastic models: An algorithmic approach, by Marcel R. Neuts, The Johns Hopkins University Press, Baltimore, 1981, 352 pp. Price: $32.50. 311-312 - James McKenna:
Computational algorithms for closed queueing networks, by Steven C. Bruell and Gianfranco Balbo, North Holland, 1980, 190 pp. Price: $22.95. 313-314 - Robert P. Kelley:
Computer systems performance modeling, by Charles H. Sauer and K. Mani Chandy, Prentice-Hall, 1981, 352pp. Price: $18.95. 314-315 - C. B. Millham:
Linear programming, by Ronald I. Rothenberg, Elsevier North Holland, New York, 1979, 359pp. Price: $24.95. 315-316
Volume 13, Number 3
- Robert J. Opsut, Fred S. Roberts
:
Optimal I-Intersection assignments for graphs: A linear programming approach. 317-326 - Robert J. Opsut, Fred S. Roberts:
I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications. 327-345 - Frank Harary:
Conditional connectivity. 347-357 - Edward Minieka:
Anticenters and antimedians of a network. 359-364 - Yehoshua Perl, Marc Snir:
Circuit partitioning with size and connection constraints. 365-375 - Fanica Gavril, Robert Tamari:
An algorithm for constructing edge-trees from hypergraphs. 377-388 - Orin Chein, Leon Steinberg:
Routing past unions of disjoint linear barriers. 389-398 - Witold Lipski Jr.:
Finding a manhattan path and related problems. 399-409 - G. Gallo:
Lower planes for the network design problem. 411-425 - John G. Klincewicz:
A Newton method for convex separable network flow problems. 427-442 - Hiroaki Ishii, Toshio Nishida:
Stochastic bottleneck spanning tree problem. 443-449
- Peter Brucker:
Linear and Combinatorial Optimization in Ordered Algebraic Structures, by U. Zimmermann, North-Holland, Amsterdam, 1981, 380 pp. Price: $61.00. 451
Volume 13, Number 4, Winter 1983
- Michael O. Ball, Ulrich Derigs:
Preface. 453-454
- Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki:
Reductions to 1-matching polyhedra. 455-473 - David Avis:
A survey of heuristics for the weighted matching problem. 475-493 - Egon Balas, William R. Pulleyblank:
The perfectly matchable subgraph polytope of a bipartite graph. 495-516 - Michael O. Ball, Ulrich Derigs:
An analysis of alternative strategies for implementing matching algorithms. 517-549 - James B. Orlin:
Dynamic matchings and quasidynamic fractional matchings. I. 551-562 - James B. Orlin:
Dynamic matchings and quasidynamic fractional matchings. II. 563-580
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-08 20:34 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:
