Multistate components assignment problem with optimal network reliability subject to assignment budget
Publication:555430
DOI10.1016/j.amc.2011.05.001zbMath1217.90131OpenAlexW2058796828MaRDI QIDQ555430
Publication date: 22 July 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.001
genetic algorithmstochastic-flow networkassignment budgetmultistate components assignmentoptimal network reliabilitystate-space decomposition
Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Assignment problems: a golden anniversary survey
- Elitist genetic algorithm for assignment problem with imprecise goal
- A genetic algorithm for the generalised assignment problem
- Resource allocation decisions under various demands and cost requirements in an unreliable flow network
- Reliable and economic resource allocation in an unreliable flow network
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- A genetic algorithm for the project assignment problem
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- A genetic algorithm for the generalised assignment problem
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
This page was built for publication: Multistate components assignment problem with optimal network reliability subject to assignment budget