2012•Unpublished venueRequires access

Solving Dynamic 0-1 Knapsack Problems Based on Dynamic Programming Algorithm

Suogang Gao

Abstract

Random time-varying knapsack problem(RTVKP) is a dynamic combinatorial optimization problem,is a typical NP-hard problem too.Because the value and size of items and the size of knapsack can change along with the time,it causes that solving this problem is more difficult.We proposed an efficient algorithm for solving RTVKP with dynamic size of knapsack based on dynamic programming method,and analyzed the complexity of new algorithm and the condition of its successful executing.The results of simulation computation show that the exact algorithm is an efficient algorithm for solving RTVKP.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 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

Key concepts: Knapsack problem, Continuous knapsack problem, Change-making problem, Computer science, Dynamic programming, Polynomial-time approximation scheme, Computation, Algorithm