ScholarLens Back to search
2007•Jisuanji gongcheng yu shejiRequires access

Backtracking algorithm of dynamic state space tree

Pingzhang Gou

Open publisher page 0 citations

Abstract

The knapsack problem and 0-1 knapsack problem are introduced,the backtracking algorithm(one of the basic methods of the computer algorithm design) and the concept of state space are described,a backtracking algorithm based on dynamic state space tree which is useful for resolving linear programming is proposed.Take 0-1 knapsack problem for example,in contrast to static state space tree algorithm,the new algorithm spends less times and it helps to extend the application of backtracking algorithm.

About this research paper

What this paper is about

The knapsack problem and 0-1 knapsack problem are introduced,the backtracking algorithm(one of the basic methods of the computer algorithm design) and the concept of state space are described,a backtracking algorithm based on dynamic state space tree which is useful for resolving linear programming is proposed.Take 0-1 knapsack problem for example,in contrast to static state space tree algorithm,the new algorithm spends less times and it helps to extend the application of backtracking algorithm.

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

The knapsack problem and 0-1 knapsack problem are introduced,the backtracking algorithm(one of the basic methods of the computer algorithm design) and the concept of state space are described,a backtracking algorithm based on dynamic state space tree which is useful for resolving linear programming is proposed.Take 0-1 knapsack problem for example,in contrast to static state space tree algorithm,the new algorithm spends less times and it helps to extend the application of backtracking algorithm.

Key concepts: Backtracking, Knapsack problem, Computer science, Algorithm, State space, Tree (set theory), State (computer science), Continuous knapsack problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Backtracking algorithm of dynamic state space tree — Research Paper | ScholarLens