A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
DOI10.1007/S11047-014-9470-5zbMATH Open1415.68192OpenAlexW2021304289WikidataQ124306155 ScholiaQ124306155MaRDI QIDQ2003457FDOQ2003457
Authors: Boukthir Haddar, Mahdi Khemakhem, Hamza Rhimi, Habib Chabchoub 
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-014-9470-5
Recommendations
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems
- A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
- A novel distributed quantum-behaved particle swarm optimization
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Title not available (Why is that?)
- Particle Swarm Optimization
- AI 2005: Advances in Artificial Intelligence
- Computing Partitions with Applications to the Knapsack Problem
- An exact algorithm for the knapsack sharing problem with common items
- Ambulance location and relocation models.
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Zero-one programming with many variables and few constraints
Cited In (5)
- Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Essential particle swarm optimization queen with tabu search for MKP resolution
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Quantum-inspired wolf pack algorithm to solve the 0-1 knapsack problem
Uses Software
This page was built for publication: A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003457)
