A binary modified harmony search algorithm for 0-1 knapsack problems
From MaRDI portal
Publication:5498045
DOI10.13195/J.KZYJC.2013.0721zbMATH Open1313.68204MaRDI QIDQ5498045FDOQ5498045
Authors: Haibin Ouyang, Liqun Gao, Hongzhi Liu, Xiangyong Kong 
Publication date: 11 February 2015
Recommendations
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A learned harmony search algorithm and its application to 0-1 knapsack problems
- A binary wolf pack algorithm for solving 0-1 knapsack problems
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (10)
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Title not available (Why is that?)
- A binary wolf pack algorithm for solving 0-1 knapsack problems
- Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Optimization of Performance of Genetic Algorithm for 0-1 Knapsack Problems Using Taguchi Method
- A learned harmony search algorithm and its application to 0-1 knapsack problems
- Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Solving the multi-objective 0-1 programming problem by a harmony search algorithm
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
This page was built for publication: A binary modified harmony search algorithm for 0-1 knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498045)
