A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem

DOI10.1007/s11047-014-9470-5zbMath1415.68192OpenAlexW2021304289WikidataQ124306155 ScholiaQ124306155MaRDI QIDQ2003457

Mahdi Khemakhem, Habib Chabchoub, Boukthir Haddar, Hamza Rhimi

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

zbMATH Keywords

discrete optimizationknapsackhybrid heuristicmax-min optimizationpopulation-based heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• An exact algorithm for the knapsack sharing problem with common items
• Zero-one programming with many variables and few constraints
• Ambulance location and relocation models.
• Particle Swarm Optimization
• Computing Partitions with Applications to the Knapsack Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• AI 2005: Advances in Artificial Intelligence

This page was built for publication: A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem