default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 15
Volume 15, Number 1, Spring 1985
- Andranik Mirzaian:
Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. 1-20 - Giovanni Andreatta, Francesco Mason:
Properties of the k-centra in a tree network. 21-25 - Eric Neufeld, Charles J. Colbourn:
The most reliable series-parallel networks. 27-32 - Takao Ozawa:
A routing procedure for an IC module with many pins - a solution to a circular permutation layout problem. 33-48 - Jayme Luiz Szwarcfiter:
On digraphs with a rooted tree structure. 49-57 - Stephen C. Graves, James B. Orlin:
A minimum concave-cost dynamic network flow problem with an application to lot-sizing. 59-71 - Robert C. Brigham, Ronald D. Dutton:
A compilation of relations between graph invariants. 73-107 - Kevin White, Martin Farber, William R. Pulleyblank:
Steiner trees, connected domination and strongly chordal graphs. 109-124 - Dominique de Werra:
On the multiplication of divisions: The use of graphs for sports scheduling. 125-136
- Dan Gusfield:
Data structures and algorithms, by A. Aho, J. Hopcroft, and J. Ullman, Addison-Wesley, Reading, Mass., 1983, 427 pp. Price: $28.85. 137-138 - Jack Yurkiewicz:
Constrained optimization and Lagrange multiplier methods, by D. P. Bertsekas, Academic Press, New York, 1982, 395 pp. Price: $65.00. 138-140 - T. Ibaraki:
Methods of the allocation of limited resources, by K. M. Mjelde, John Wiley and Sons, Chichester, 1983, 88 pp. Price: $24.95. 140-141 - Bhaskar Sengupta:
Introduction to dynamic programming, by Leon Cooper and Mary W. Cooper, Pergamon Press, Elmsford, NY, 1981, 289 pp. Price: $19.50 softcover, $32.50 hardcover. 141-142
Volume 15, Number 2, Summer 1985
- Krzysztof Kozminski, Edwin Kinnen:
Rectangular duals of planar graphs. 145-157 - Arthur L. Liestman:
Fault-tolerant broadcast graphs. 159-171 - R. Kevin Wood:
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability. 173-190 - Gabriel Y. Handler, Margalit Rozman:
The continuous m-center problem on a network. 191-204 - William H. Cunningham:
Minimum cuts, modular functions, and matroid polyhedra. 205-215 - Michael B. Richey, R. Gary Parker, Ronald L. Rardin:
An efficiently solvable case of the minimum weight equivalent subgraph problem. 217-228 - Steve Alpern, Miroslav D. Asic:
The search value of a network. 229-238 - Avinash Agrawal, Appajosyula Satyanarayana:
Network reliability analysis using 2-connected digraph reductions. 239-256 - Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell:
Combinatorial optimization problems in the analysis and design of probabilistic networks. 257-271
- Jeff Horen:
Linear programming, by Katta G. Murty, John Wiley & Sons, New York, 1983, 482 pp. 273-274
Volume 15, Number 3
- Oded Berman:
Locating a facility on a congested network with random lengths. 275-293 - Alain Haurie, Patrice Marcotte:
On the relationship between Nash - Cournot and Wardrop equilibria. 295-308 - Edward Minieka:
The optimal location of a path or tree in a tree network. 309-321 - Pawel Winter:
An algorithm for the steiner problem in the euclidean plane. 323-345 - Richard T. Wong:
Probabilistic analysis of a network design problem heuristic. 347-363 - Dan Trietsch, Gabriel Y. Handler:
The Gilbert and Pollak conjecture - a generalization. 365-380 - M. Jeger, Oded Kariv:
Algorithms for finding P-centers on a weighted tree (for relatively small P). 381-389
- Jack Yurkiewicz:
Nonlinear programming: Theory, algorithms, and applications by G. P. McCormick, Wiley, New York, 1983, 444 pp. Price: $48.50. 391-392 - Richard T. Wong:
Linear programming, by Vasek Chvatal, W. H. Freeman and Company, New York, 1983, 478 pp., Price: $24.95. 393
Volume 15, Number 4, Winter 1985
- M.-L. Chen, Richard L. Francis, J. F. Lawrence, Timothy J. Lowe, S. Tufekci:
Block-vertex duality and the one-median problem. 395-412 - János Komlós, M. T. Shing:
Probabilistic partitioning algorithms for the rectilinear steiner problem. 413-423 - Baruch Awerbuch:
Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization. 425-437 - Ding-Zhu Du, Frank K. Hwang:
Optimal consecutive-2 systems of lines and cycles. 439-447 - Frank K. Hwang, Lawrence A. Shepp:
Component-level redundancy is better than system-level redundancy for channel graphs. 449-453 - Alberto Garcia-Diaz:
A heuristic circulation-network approach to solve the multi-traveling salesman problem. 455-467 - Heinz Gröflin:
On node constraint networks. 469-475 - Fan R. K. Chung, Michael R. Garey, Robert Endre Tarjan:
Strongly connected orientations of mixed multigraphs. 477-484
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-08-12 22:59 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.
