Knapsack problem

Known as: Unbounded knapsack problem, Binary knapsack problem, BKP 
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2017
010020019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Geometric Constraint and Cutting planes have been successfully used to solve the 0–1 multidimensional knapsack problem. Our… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing… (More)
  • table 1
  • table 2
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… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A genetic algorithm, GENEsYs, is applied to an NP-complele problem, the 0/1 multiple knapsack problem. The partitioning of the… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
item in the big bin and obtains a profit of 1 while OPT = 2. This also shows that ordering bins in non-increasing capacities does… (More)
  • figure 1
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Considered is a knapsack with integer volume Fand which is capable of holding K different classes of objects. An object from… (More)
  • figure 1
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… (More)
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… (More)
  • table I
  • table IV
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… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?