Branch-and-bound-based algorithm for solving the multi-type component assignment problem in a consecutive- k $k$ -out-of- n $n$ : F system.
Taishin NakamuraHisashi YamamotoPublished in: Qual. Reliab. Eng. Int. (2022)
Keyphrases
- branch and bound
- optimal solution
- combinatorial optimization
- search space
- objective function
- integer programming problems
- implicit enumeration
- multi type
- linear programming
- particle swarm optimization
- branch and bound algorithm
- bnb adopt
- k means
- probabilistic model
- np hard
- cost function
- convex hull
- search algorithm
- feature space
- column generation
- mixed integer programming
- network design problem
- branch and bound procedure
- database