Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,670,191 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.
2018
2018
An heuristic cloud based segmentation technique using edge and texture based two dimensional entropy
Mathivannan Jaganathan
,
A. Sabari
Cluster Computing
2018
Corpus ID: 6630268
The Edge detection will localize the objects and their boundaries within an image which is a basis for various image analysis and…
Expand
2006
2006
Substitution of hardwood kraft with aspen high-yield pulp in lightweight coated wood-free papers Part I. Synergy of basestock properties
Kaitang Hu
,
Y. Ni
,
Yajun Zhou
,
X. Zou
2006
Corpus ID: 106405348
We conducted a systematic investigation of the effects of substituting high-yield pulp (HYP) for hardwood bleached kraft pulp…
Expand
2005
2005
A Simple Approach to Evolutionary Multiobjective Optimization
Christine L. Mumford-Valenzuela
Evolutionary Multiobjective Optimization
2005
Corpus ID: 7185197
This chapter describes a Pareto-based approach to evolutionary multiobjective optimization, that avoids most of the time…
Expand
2004
2004
Solving Knapsack Problems with Attribute Grammars
M. O’Neill
,
R. Cleary
,
Nikolay Nikolov
2004
Corpus ID: 14694494
We present a work in progress describing attribute grammar approaches to Grammatical Evolution, which allow us to encode context…
Expand
2002
2002
Bit allocation in sub-linear time and the multiple-choice knapsack problem
A. Mohr
Proceedings DCC . Data Compression Conference
2002
Corpus ID: 9709854
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is…
Expand
2000
2000
Performance evaluation of a firewall-compliant Globus-based wide-area cluster system
Yoshio Tanaka
,
Motonori Hirano
,
M. Sato
,
H. Nakada
,
S. Sekiguchi
Proceedings the Ninth International Symposium on…
2000
Corpus ID: 5614305
Presents a performance evaluation of a wide-area cluster system based on a firewall-enabled Globus metacomputing toolkit. In…
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
Review
1999
Review
1999
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem
J. Gottlieb
Artificial Evolution
1999
Corpus ID: 43135454
When designing evolutionary algorithms (EAs) for the multidimensional knapsack problem, it is important to consider that the…
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
1993
1993
Dynamic programming parallel implementations for the knapsack problem
R. Andonov
,
Frédéric Raimbault
,
P. Quinton
1993
Corpus ID: 6694533
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The algorithm can run on any…
Expand