A branch and bound algorithm for designing reliable systems at a minimum cost
From MaRDI portal
Publication:5931708
DOI10.1016/S0096-3003(99)00217-9zbMath1032.90072MaRDI QIDQ5931708
Mohamed Djerdjour, Kamel Rekab
Publication date: 25 April 2001
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
90C90: Applications of mathematical programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems, Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method, An improved test set approach to nonlinear integer problems with applications to engineering design, An exact algorithm for cost minimization in series reliability systems with multiple component choices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear Integer Goal Programming Applied to Optimal System Reliability
- Optimal Reliability Allocation by Branch-and-Bound Technique