An exact algorithm for large unbounded knapsack problems

Authors:
Silvano Martello;Paolo Toth
Affiliations:
DEIS, University of Bologna, Bologna, Italy;DEIS, University of Bologna, Bologna, Italy
Venue:
Operations Research Letters
Year:
1990

Citing 5
Cited 1

On equivalent knapsack problems

Discrete Applied Mathematics
A new algorithm for the 0-1 knapsack problem

Management Science
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

Journal of the ACM (JACM)
A Polynomial Algorithm for the Two-Variable Integer Programming Problem

Journal of the ACM (JACM)

A note on dominance relation in unbounded knapsack problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given n types, each having an associated profit and weight, and a container of given capacity, the unbounded knapsack problem is to determine the number of items of each type to be selected so that the corresponding total profit is a maximum and the corresponding total weight does not exceed the capacity. We present upper bounds, dominance relations, and an approach-based on the definition of a core problem-to the exact solution of very large instances of the problem. We give the results of computational experiments on randomly generated test problems involving up to 250 000 item types.