Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,620 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.
2013
2013
Dynamic Software-Defined Resource Optimization in Next-Generation Optical Access Enabled by OFDMA-Based Meta-MAC Provisioning
K. Kanonakis
,
N. Cvijetic
,
Ioannis Tomkos
,
Ting Wang
Journal of Lightwave Technology
2013
Corpus ID: 37548379
In order to address a diverse and demanding set of service and network drivers, several technology candidates with inherent…
Expand
Highly Cited
2009
Highly Cited
2009
The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems
P. Chang
,
Shih-Hsin Chen
Applied Soft Computing
2009
Corpus ID: 19602992
2006
2006
A variable-grouping based genetic algorithm for large-scale integer programming
Zhongsheng Hua
,
Feihua Huang
Information Sciences
2006
Corpus ID: 38219681
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
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
Highly Cited
1994
Highly Cited
1994
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
G. Nemhauser
,
P. H. Vance
Operations Research Letters
1994
Corpus ID: 1896373
Highly Cited
1994
Highly Cited
1994
Darboux Transformations from Reductions of the KP Hierarchy
J. Nimmo
1994
Corpus ID: 17768410
The use of effective Darboux transformations for general classes Lax pairs is discussed. The general construction of ``binary…
Expand
Highly Cited
1994
Highly Cited
1994
Penalty functions and the knapsack problem
Anne L. Olsen
Proceedings of the First IEEE Conference on…
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…
Expand
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
Highly Cited
1975
Highly Cited
1975
Resolution of the 0–1 knapsack problem: Comparison of methods
D. Fayard
,
G. Plateau
Mathematical programming
1975
Corpus ID: 206797869
A method of solving the 0–1 knapsack problem which derives from the “shrinking boundary method” is described and compared to…
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