A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
DOI10.1016/J.CAM.2013.09.052zbMATH Open1314.90067DBLPjournals/jcam/AzadRF14OpenAlexW2066653502WikidataQ57573511 ScholiaQ57573511MaRDI QIDQ2349685FDOQ2349685
Authors: Md. Abul Kalam Azad, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes 
Publication date: 17 June 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.09.052
Recommendations
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
- A binary wolf pack algorithm for solving 0-1 knapsack problems
- scientific article; zbMATH DE number 6263318
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The quadratic knapsack problem -- a survey
- Title not available (Why is that?)
- Quadratic knapsack problems
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Solution of large quadratic knapsack problems through aggressive reduction
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A new upper bound for the 0-1 quadratic knapsack problem
- An augmented Lagrangian fish swarm based method for global optimization
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- ``Miniaturized linearizations for quadratic 0/1 problems
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
- Title not available (Why is that?)
Cited In (9)
- An adaptive multiscale approach for identifying multiple flaws based on XFEM and a discrete artificial fish swarm algorithm
- Optimal chiller loading by improved artificial fish swarm algorithm for energy saving
- Improved sleep mode mechanism based on IEEE 802.16e
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
- A diverse human learning optimization algorithm
Uses Software
This page was built for publication: A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349685)
