Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,522,331 papers from all fields of science
Search
Sign In
Create Free Account
Knapsack problem
Known as:
Unbounded knapsack problem
, Binary knapsack problem
, BKP
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
40 relations
Approximation algorithm
Baby-step giant-step
Backtracking
Bin packing problem
Expand
Broader (3)
Combinatorial optimization
Dynamic programming
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Physarum-inspired optimization algorithm for load-shedding problem
Chao Gao
,
Shi Chen
,
Xianghua Li
,
Jiajin Huang
,
Z. Zhang
Applied Soft Computing
2017
Corpus ID: 30676808
2013
2013
Resource Allocation in Cognitive Radio Relay Networks
Jui-Chi Liang
,
Jyh-cheng Chen
IEEE Journal on Selected Areas in Communications
2013
Corpus ID: 31630702
Cognitive radio has received great attention recently for its ability to improve spectrum efficiency by letting secondary users…
Expand
2008
2008
Bottom-Up Self-Organization of Unpredictable Demand and Supply under Decentralized Power Management
H. Wedde
,
S. Lehnhoff
,
C. Rehtanz
,
O. Krause
Second IEEE International Conference on Self…
2008
Corpus ID: 3891884
In the DEZENT project we had established a distributed base model for negotiating electric power from widely distributed…
Expand
Highly Cited
2003
Highly Cited
2003
Dual-based heuristics for a hierarchical covering location problem
Luis Gonzalo Acosta Espejo
,
R. D. Galvão
,
B. Boffey
Computers & Operations Research
2003
Corpus ID: 9134072
2002
2002
Generalizing the KP Hierarchies: Pfaffian Hierarchies
C. Gilson
2002
Corpus ID: 117711698
We derive the Pfaffian analogues of the equations in the single-component KP hierarchies and the modified KP hierarchies and…
Expand
2001
2001
Optimization of Dynamic Hardware Reconfigurations
J. Teich
,
S. Fekete
,
Jörg Schepers
Journal of Supercomputing
2001
Corpus ID: 13985572
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run…
Expand
Highly Cited
1999
Highly Cited
1999
Instruction Scheduling for TriMedia
J. Hoogerbrugge
,
L. Augusteijn
J. Instr. Level Parallelism
1999
Corpus ID: 12207169
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes…
Expand
1996
1996
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
S. Hanafi
,
A. Fréville
,
A. Abdellaoui
1996
Corpus ID: 115379767
The multidimensional 0–1 knapsack problem (0–1MKP) is a generalization of the well-known 0–1 knapsack problem. As for any hard…
Expand
1994
1994
The capacity expansion problem in the service industry
Oded Herman
,
Z. Ganz
Computers & Operations Research
1994
Corpus ID: 33540226
1993
1993
Database and display algorithms for interactive visualization of architectural models
T. Funkhouser
,
C. Séquin
1993
Corpus ID: 60622160
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required