Publication:4766894
From MaRDI portal
zbMath0281.94012MaRDI QIDQ4766894
Publication date: 1971
90B10: Deterministic network models in operations research
94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
94A05: Communication theory
Related Items
Unnamed Item, Exact calculation of computer network reliability, Some problems in discrete optimization, Optimal design of centralized computer networks, Routing in computer networks, Lower bounds on the vulnerability of a graph, A sum of disjoint products algorithm for reliability evaluation of flow networks, Survivable networks, linear programming relaxations and the parsimonious property, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity, Optimally reliable networks, On-line computation of minimal and maximal length paths, Path delays in communication networks, Sensitivity analysis in stochastic flow networks using the Monte Carlo method, Unnamed Item, Maximal expected flow in a network subject to arc failures, Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity, Efficient algorithms for generalized cut‐trees, Characterizing stochastic flow networks using the monte carlo method, An improved version of the out-of-kilter method and a comparative study of computer codes, A minimum-cost multicommodity network flow problem concerning imports and exports, Maximum flow in probabilistic graphs-the discrete case, A new deterministic network reliability measure, Analyse und Synthese zuverlässiger Netze
