Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
type: Item
instance of: scholarly article
title: Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
zbMATH Open document ID: 1335.90078
author: Md. Abul Kalam Azad
author: Ana Maria A. C. Rocha
author: Edite M. G. P. Fernandes
published in: Journal of Mathematical Modelling and Algorithms in Operations Research
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6515163
zbMATH Keywords: artificial fish swarm
zbMATH Keywords: heuristic search
zbMATH Keywords: 0-1 knapsack problem
zbMATH Keywords: multidimensional knapsack
Wikidata QID: Q57573506
describes a project that uses: Genocop
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10852-015-9275-2
OpenAlex ID: W1996673460
cites work: Greedy algorithm for the general multidimensional knapsack problem
cites work: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
cites work: A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
cites work: A Modified Binary Particle Swarm Optimization for Knapsack Problems
cites work: A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
cites work: Heuristics for the 0-1 multidimensional knapsack problem
cites work: An Enumeration Algorithm for Knapsack Problems
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method
cites work: Q3515603
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: A statistical analysis of the knapsack problem
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
cites work: An ant colony optimization approach for the multidimensional knapsack problem
cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem
cites work: Q4873721
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: The multidimensional knapsack problem: structure and algorithms
cites work: An augmented Lagrangian fish swarm based method for global optimization
cites work: Genetic algorithms with double strings for 0-1 programming problems
cites work: The growth of m-constraint random knapsacks
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Zero-one programming with many variables and few constraints
cites work: Improved results on the 0--1 multidimensional knapsack problem
DBLP publication ID: journals/jmma/AzadRF15
DOI: 10.1007/S10852-015-9275-2
description: scientific article; zbMATH DE number 6515163