Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems
From MaRDI portal
Publication:1772975
DOI10.1007/s10479-004-5034-xzbMath1119.90078OpenAlexW2092626150MaRDI QIDQ1772975
Publication date: 22 April 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-004-5034-x
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components ⋮ Optimal distribution of reliability for a large network based on connectivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the computational complexity of reliability redundancy allocation in a series system
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Global optimization of multiplicative programs
- \(NP\)-hardness of linear multiplicative programming and related problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- A New Heuristic Algorithm for Constrained Redundancy-Optimization in Complex Systems
- A Reliability Optimization Method for Complex Systems with the Criterion of Local Optimality
- Tabu Search—Part I
- Tabu Search—Part II
- Redundancy Optimization in General Systems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- A heuristic method for solving redundancy optimization problems in complex systems
- Handbook of metaheuristics
- A convexification method for a class of global optimization problems with applications to reliability optimization
