Pages that link to "Item:Q2950520"
From MaRDI portal
The following pages link to Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520):
Displaying 6 items.
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- Extended prey-predator algorithm with a group hunting scenario (Q1748498) (← links)
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
- A novel dynamic generalized opposition-based grey wolf optimization algorithm (Q2331450) (← links)
- (Q4495207) (← links)
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)