Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
From MaRDI portal
(Redirected from Publication:894546)
Recommendations
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
Cites work
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A hybrid genetic algorithm for the multidimensional knapsack problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A statistical analysis of the knapsack problem
- An Enumeration Algorithm for Knapsack Problems
- An ant colony optimization approach for the multidimensional knapsack problem
- An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method
- An augmented Lagrangian fish swarm based method for global optimization
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Genetic algorithms with double strings for 0-1 programming problems
- Greedy algorithm for the general multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- The growth of m-constraint random knapsacks
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional knapsack problem: structure and algorithms
- Zero-one programming with many variables and few constraints
Cited in
(6)- Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
- A RNN-based hyper-heuristic for combinatorial problems
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
This page was built for publication: Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894546)
