Pages that link to "Item:Q342027"
From MaRDI portal
The following pages link to Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027):
Displaying 7 items.
- A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm (Q2224310) (← links)
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
- A learned harmony search algorithm and its application to 0-1 knapsack problems (Q2859967) (← links)
- Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When? (Q3304189) (← links)
