Pages that link to "Item:Q2267820"
From MaRDI portal
The following pages link to An ant colony optimization approach for the multidimensional knapsack problem (Q2267820):
Displaying 15 items.
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- An ant colony optimization approach for binary knapsack problem under fuzziness (Q907543) (← links)
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem (Q2983735) (← links)
- (Q3052180) (← links)
- Ant colony optimization and local search for bin packing and cutting stock problems (Q4661198) (← links)
- A novel ant colony optimization algorithm for the shortest-path problem in traffic networks (Q5024603) (← links)
- (Q5195390) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5901723) (← links)
