Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
From MaRDI portal
Publication:894546
DOI10.1007/s10852-015-9275-2zbMath1335.90078OpenAlexW1996673460WikidataQ57573506 ScholiaQ57573506MaRDI QIDQ894546
Edite M. G. P. Fernandes, Ana Maria A. C. Rocha, Md. Abul Kalam Azad
Publication date: 1 December 2015
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-015-9275-2
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- An augmented Lagrangian fish swarm based method for global optimization
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- The growth of m-constraint random knapsacks
- Heuristics for the 0-1 multidimensional knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Zero-one programming with many variables and few constraints
- A genetic algorithm for the multidimensional knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- A minimal algorithm for the multiple-choice knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Genetic algorithms with double strings for 0-1 programming problems
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- An ant colony optimization approach for the multidimensional knapsack problem
- An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- A statistical analysis of the knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- An Enumeration Algorithm for Knapsack Problems
