2014•IEEE SoftwareRequires access

Two Algorithms Based on 0-1 Knapsack Problem

Qian Li

Abstract

The 0-1 knapsack problem is a classical problem in Computer Science, 0-1 knapsack problem is an optimization problem. Because of its simple structure, strong scalability, it can be used as sub problems of other problems. Therefore the research can solve more complex optimization problems. This paper summarizes the two kinds of algorithms to solve 0-1 knapsack problem,finally two algorithms are compared and analyzed.

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, Continuous knapsack problem, Cutting stock problem, Scalability, Generalized assignment problem, Change-making problem, Polynomial-time approximation scheme, Optimization problem