Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Vitis labrusca grapes are widely cultivated in some countries such as Brazil and the United States, especially for juice… 
2008
2008
In the DEZENT project we had established a distributed base model for negotiating electric power from widely distributed… 
2001
2001
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run… 
Highly Cited
1999
Highly Cited
1999
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes… 
Highly Cited
1994
Highly Cited
1994
The use of effective Darboux transformations for general classes Lax pairs is discussed. The general construction of ``binary… 
Highly Cited
1994
Highly Cited
1994
  • Anne L. Olsen
  • 1994
  • Corpus ID: 42230837
This paper reports on a study of the effectiveness of penalty functions used with a standard genetic algorithm to solve a problem… 
1993
1993
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking…