A binary differential search algorithm for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:2281727
DOI10.1016/j.apm.2016.06.002zbMath1443.90047OpenAlexW2465907943MaRDI QIDQ2281727
Changzhi Wu, Jiang Cao, Xiangyu Wang, Kok Lay Teo, Jian-Jun Liu
Publication date: 6 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2016.06.002
Combinatorial optimization (90C27) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Related Items (5)
Two-dimensional knapsack-block packing problem ⋮ Maximizing lifetime of a wireless sensor network via joint optimizing sink placement and sensor-to-sink routing ⋮ Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks ⋮ Stochastic project scheduling with hierarchical alternatives ⋮ A fully distributed ADMM-based dispatch approach for virtual power plant problems
Uses Software
Cites Work
- A conic approximation method for the 0-1 quadratic knapsack problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- A novel differential search algorithm and applications for structure design
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- An ant colony optimization approach for binary knapsack problem under fuzziness
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Genetic algorithms with double strings for 0-1 programming problems
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Some new results on multi-dimension Knapsack problem
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- An exact algorithm for 0-1 polynomial Knapsack problems
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- An Artificial Bee Colony Algorithm for the 0–1 Multidimensional Knapsack Problem
- A survey of effective heuristics and their application to a variety of knapsack problems
This page was built for publication: A binary differential search algorithm for the 0-1 multidimensional knapsack problem
