Overview of network reliability Approaches for calculating network reliability An algebraic formulation of network reliability problems Bounds on two-terminal reliability Enumeration of paths and… Expand

Abstract Several applications involve finding shortest paths in bicriterion networks: those in which each arc possesses two characteristics (such as time and cost). In these circumstances, it is… Expand

A study was completed of more than 170,000 records of pediatric venous blood levels and supporting demographic information collected in New York City during 1970-1976. The geometric mean (GM) blood… Expand

A problem encountered in the apparel industry is that of producing, with no excess, a known number of different styles from the same cloth, without any excess garments.Expand

This paper considers the problem of locating p facilities on a tree network in order to minimize the maximum distance from a point on the network to its nearest facility. Such a problem might arise,… Expand

An algorithm for finding maximal chordal subgraphs is developed that has worst-case time complexity of O(|E|Δ), where |E| is the number of edges in G and Δ is the maximum vertex degree in G.Expand

Plusieurs approches pour evaluer la fiabilite d'un reseau necessitent de generer tous les ensembles de coupe minimaux dans un graphe oriente, et on propose pour cela un algorithme general iteratif, base sur une structure algebrique sous-jacente.Expand