2010•Computer Knowledge and TechnologyRequires access

Based on the Greedy Algorithm of 0-1 Knapsack Problems

Xi Chen

Abstract

The greedy algorithm is the solution to the problem of an algorithm,because of its solving problems with simplicity,intuitive and the efficiency is favour.When un-solved problems that have the most YouZi structure and moment-the greedy-choice properties,can consider to use greedy algorithm.0-1 knapsack problems in computer problems is a common problem in the text,was described by the greedy algorithm to solve 0-1 knapsack problems.And obtained by greedy algorithm for solving this problem can obtain optimal solutions.

About this research paper

What this paper is about

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

Key concepts: Knapsack problem, Greedy algorithm, Continuous knapsack problem, Greedy randomized adaptive search procedure, Change-making problem, Computer science, Mathematical optimization, Algorithm