ScholarLens Back to search
2011•Journal of Wuhan Engineering InstituteRequires access

Fireworks Algorithm for Solving 0/1 Knapsack Problem

Jiaqi Zhang

Open publisher page 5 citations

Abstract

0/1 knapsack problem is a kind of NP problems,which is of great theoretical significance and widespread usage.This paper tries to adopt fireworks algorithm which is recently developed in Peking University to solve 0/1 knapsack problem.The initial solving algorithm and extensive experiments are introduced.The research carried out in this paper is a brand new way for solving 0/1 knapsack problem.

About this research paper

What this paper is about

0/1 knapsack problem is a kind of NP problems,which is of great theoretical significance and widespread usage.This paper tries to adopt fireworks algorithm which is recently developed in Peking University to solve 0/1 knapsack problem.The initial solving algorithm and extensive experiments are introduced.The research carried out in this paper is a brand new way for solving 0/1 knapsack problem.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

0/1 knapsack problem is a kind of NP problems,which is of great theoretical significance and widespread usage.This paper tries to adopt fireworks algorithm which is recently developed in Peking University to solve 0/1 knapsack problem.The initial solving algorithm and extensive experiments are introduced.The research carried out in this paper is a brand new way for solving 0/1 knapsack problem.

Key concepts: Knapsack problem, Continuous knapsack problem, Cutting stock problem, Change-making problem, Algorithm, Polynomial-time approximation scheme, Mathematical optimization, Generalized assignment problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fireworks Algorithm for Solving 0/1 Knapsack Problem — Research Paper | ScholarLens