A recursive algorithm for the 0–1 knapsack problem

A recursive algorithm for the 0–1 knapsack problem

0.00 Avg rating0 Votes
Article ID: iaor20041796
Country: China
Volume: 19
Issue: 6
Start Page Number: 50
End Page Number: 52
Publication Date: Nov 2002
Journal: Journal of Yiyang Teachers College
Authors:
Keywords: knapsack problem
Abstract:

This paper analyzes the routine algorithm to solve the knapsack in the past, and puts forward a more efficient method (recursive) to solve it.

Reviews

Required fields are marked *. Your email address will not be published.