Dichotomous binary differential evolution for knapsack problems
DOI10.1155/2016/5732489zbMATH Open1400.90225OpenAlexW2566904163WikidataQ59131682 ScholiaQ59131682MaRDI QIDQ1793333FDOQ1793333
Authors: Hu Peng, Peng Shao, Changshou Deng, Z. Wu 
Publication date: 12 October 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/5732489
Recommendations
- Novel binary differential evolution algorithm for knapsack problems
- A binary differential evolution algorithm based on a parameterless mutation strategy
- Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
- A novel differential evolution algorithm for binary optimization
- Evolutionary algorithms for knapsack problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- The design of approximation algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The multidimensional knapsack problem: structure and algorithms
- A trigonometric mutation operation to differential evolution
- The multidimensional 0-1 knapsack problem: an overview.
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Differential Evolution for Binary Encoding
- The cellular differential evolution based on chaotic local search
Cited In (10)
- Differential Evolution for Binary Encoding
- Working principles of binary differential evolution
- A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem
- Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
- A binary differential evolution algorithm based on a parameterless mutation strategy
- Novel binary differential evolution algorithm for knapsack problems
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
- Relative position indexing approach
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- A novel differential evolution algorithm for binary optimization
Uses Software
This page was built for publication: Dichotomous binary differential evolution for knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793333)
