Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems

MaRDI QIDQ4984562zbMATH OpenFDO

Authors Jian Zheng

Publication date 26 April 2021

zbMATH Keywords

0-1 knapsack problemcombinatorial optimizationsine cosine algorithmswarm intelligence

Mathematics Subject Classification ID

Randomized algorithms (68W20) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Recommendations

• Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
• A binary modified harmony search algorithm for 0-1 knapsack problems
• A New Algorithm for the 0-1 Knapsack Problem
• Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
• An improved genetic algorithm for solving 0-1 knapsack problems

Cited in

(1)

• Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem

This page was built for publication: Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4984562)