Pages that link to "Item:Q976017"
From MaRDI portal
The following pages link to Black box scatter search for general classes of binary optimization problems (Q976017):
Displaying 10 items.
- A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique (Q2061776) (← links)
- Black-box optimization in an extended search space for SAT solving (Q2181777) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Context-independent scatter and tabu search for permutation problems (Q2890461) (← links)
- Generalised Sifting in Black-Box Groups (Q3430812) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)