scientific article; zbMATH DE number 3441964
From MaRDI portal
Publication:4766894
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Communication theory (94A05)
Cited in
(47)- Distance center and centroid of a median graph
- Maximum flow and critical cutset as descriptors of multi-state systems with randomly capacitated components
- 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
- Optimization problems of transportation in communication networks with variable capacities
- Analysis of critical damage in the communication network. I: Model and computational experiment
- Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability
- Analysis of cluster damages in network systems
- The -maximum flow model with uncertain capacities
- Sensitivity analysis in stochastic flow networks using the Monte Carlo method
- Graphs with the smallest number of minimum cut sets
- Synthesis of directed multicommodity flow networks
- Communication in markets. A suggested approach
- On a function for the vulnerability of a directed flow network
- Incorporating dependent node damage in deterministic connectivity analysis and synthesis of networks
- The structure of distances in networks
- Maximal expected flow in a network subject to arc failures
- On the computational complexity of centers locating in a graph
- Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
- Realizability ofp-point,q-line graphs with prescribed point connectivity, line connectivity, or minimum degree
- Maximum flow in networks with a small number of random arc capacities
- 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
- Nodal interdiction
- Maximum flow in probabilistic graphs-the discrete case
- A new deterministic network reliability measure
- Analyse und Synthese zuverlässiger Netze
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
- A value focused model for a C4 network
- Bounds on the mean of the maximum of a number of normal random variables
- scientific article; zbMATH DE number 4115803 (Why is no real title available?)
- Exact calculation of computer network reliability
- Topological reversibility and causality in feed-forward networks
- 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
- Network reliability: Heading out on the highway
- Survivable networks, linear programming relaxations and the parsimonious property
- Maximum flow in hybrid network with intermediate storage
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- Flow equivalent trees in undirected node-edge-capacitated planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4766894)
