Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

Since no competitive online algorithms exist for general knapsack problems, we consider online variants of knapsack problems with… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

The Multiple Knapsack problem (MKP) is a natural and well known generalization of the single knapsack problem and is defined as… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

In this paper we present a heuristic based upon genetic algorithms for the multidimensional knapsack problem. A heuristic… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem… Expand

Is this relevant?

Highly Cited

1980

Highly Cited

1980

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on… Expand

Is this relevant?

Highly Cited

1975

Highly Cited

1975

Given a positive integer M and n pairs of positive integers (p~, cD, , (p. , c.), maximize the s u m ~ ~p~ subject to the cons t… Expand

Is this relevant?

Highly Cited

1975

Highly Cited

1975

A serms of increasingly accurate algorithms to obtain approximate solutions to the 0/1 one-dlmensmnal knapsack problem :s… Expand

Is this relevant?

Highly Cited

1974

Highly Cited

1974

Given <italic>r</italic> numbers <italic>s</italic><subscrpt>1</subscrpt>, ···, <italic>s<subscrpt>r</subscrpt></italic… Expand

Is this relevant?