Computing Network Reliability in Time Polynomial in the Number of Cuts
Article Abstract:
The probability that there is an operating path between two given nodes is calculated. The modes reside in a stochastic network. The computation time is bounded by a polynomial in the number of cuts in the network. It is shown that an algorithm with a time bound that is polynomial in network size and the number of (S,T)-paths cannot exist unless P=NP. Other algorithms enumerate pathsets and cutsets in the network. Diagrams illustrate portions of networks.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
A Polynomial Simplex Method for the Assignment Problem
Article Abstract:
A polynomial primal simplex method algorithm for the assignment problem is presented. For an nXn assignment problem with integer cost coefficients, the algorithm generates at most n cubed natural log delta bases prior to reaching the optimal basis. Delta is the difference in objective value between an initial extreme point and the optimal extreme point.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1983
User Contributions:
Comment about this article or add new information about this topic:
The Secretary Problem with Optimal Assignment
Article Abstract:
The classical secretary problem is described. Each applicant is ranked according to some quality. Applicants appear in order; their ranks are observed relative to those preceding them. They are selected or rejected with the objective of selecting the best applicant. The 3-problem is solved.
Publication Name: Operations Research
Subject: Petroleum, energy and mining industries
ISSN: 0030-364X
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Untangling the reliability issue. Customer service in the spotlight. A metering manifesto
- Abstracts: The future of utility advertising. The name in the game. Thirty seconds
- Abstracts: Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems. An Integer Programming Procedure for Assembly System Design Problems
- Abstracts: An electricity activist. Drivers of the energy scene. LNG expected to boost gas supplies
- Abstracts: The branding benefit. Utility employment outlook. Utility dot.com/future