ScholarLens Back to search
2001•Unpublished venueRequires access

A Study on Knapsack Problem by Genetic Algorithm

Xiaohui Guo

Open publisher page 0 citations

Abstract

Discusses the classical knapsack problem applies the genetic algorithm to solve the problem. Two knapsack problems show that genetic algorithm is more reasonable than other methods.

About this research paper

What this paper is about

Discusses the classical knapsack problem applies the genetic algorithm to solve the problem. Two knapsack problems show that genetic algorithm is more reasonable than other methods.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Discusses the classical knapsack problem applies the genetic algorithm to solve the problem. Two knapsack problems show that genetic algorithm is more reasonable than other methods.

Key concepts: Knapsack problem, Genetic algorithm, Continuous knapsack problem, Computer science, Algorithm, Mathematical optimization, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Study on Knapsack Problem by Genetic Algorithm — Research Paper | ScholarLens