Pages that link to "Item:Q387477"
From MaRDI portal
The following pages link to A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477):
Displaying 14 items.
- A diverse human learning optimization algorithm (Q506463) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- Shrinking hypersphere based trajectory of particles in PSO (Q902500) (← links)
- An ant colony optimization approach for binary knapsack problem under fuzziness (Q907543) (← links)
- Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- Novel binary differential evolution algorithm for knapsack problems (Q2053861) (← links)
- A novel \(x\)-shaped binary particle swarm optimization (Q2157062) (← links)
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application (Q2954352) (← links)
- Algorithms for randomized time-varying knapsack problems (Q5963612) (← links)
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems (Q6052645) (← links)
