Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
knapsack
Description:
A knapsack is a bag carried on the back, or, in mathematics and computing, a term for a class of optimization problems.
Related topics:
Complexity and Algorithms in Graphs (8%),
Optimization and Packing Problems (7%)
OpenAlex ID:
keywords/knapsack
Reducibility Among Combinatorial Problems
2012
·
Kichard Rarp
·
1,389
KNApSAcK Family Databases: Integrated Metabolite–Plant Species Databases for Multifaceted Plant Research
2011
·
Farit Mochamad Afendi
, Taketo Okada
, et al.
·
Plant and Cell Physiology
·
781
KNApSAcK: A Comprehensive Species-Metabolite Relationship Database
2006
·
Y. Shinbo
, Y. Nakamura
, et al.
·
Springer eBooks
·
222
PRIMe: A Web Site That Assembles Tools for Metabolomics and Transcriptomics
2008
·
Kenji Akiyama
, Eisuke Chikayama
, et al.
·
In Silico Biology
·
207
A Comprehensive Gene Inventory for Glucosinolate Biosynthetic Pathway in Arabidopsis thaliana
2020
·
Sarahani Harun
, Muhammad-Redha Abdullah-Zawawi
, et al.
·
Journal of Agricultural and Food Chemistry
·
160
Assessment of Metabolome Annotation Quality: A Method for Evaluating the False Discovery Rate of Elemental Composition Searches
2009
·
Fumio Matsuda
, Yoko Shinbo
, et al.
·
PLoS ONE
·
72
Metabolomics approach for determining growth-specific metabolites based on Fourier transform ion cyclotron resonance mass spectrometry
2008
·
Hiroki Takahashi
, Kosuke Kai
, et al.
·
Analytical and Bioanalytical Chemistry
·
71
PDF
Polynomial kernels for weighted problems
2016
·
Michael Etscheid
, Stefan Kratsch
, et al.
·
Journal of Computer and System Sciences
·
47
PDF
Mass Spectra-Based Framework for Automated Structural Elucidation of Metabolome Data to Explore Phytochemical Diversity
2011
·
Fumio Matsuda
, Ryo Nakabayashi
, et al.
·
Frontiers in Plant Science
·
35
PDF
Bounding the Running Time of Algorithms for Scheduling and Packing Problems
2016
·
K. Jansen
, F. Land
, et al.
·
SIAM Journal on Discrete Mathematics
·
33
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
2005
·
Hassene Aissi
, Cristina Bazgan
, et al.
·
Lecture notes in computer science
·
33
Closing the Gap for Pseudo-Polynomial Strip Packing
2017
·
Jansen, Klaus
, Rau, Malin
·
arXiv (Cornell University)
·
30
PDF
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
2009
·
MohammadHossein Bateni
, MohammadTaghi Hajiaghayi
·
Symposium on Discrete Algorithms
·
29
[Special Issue: Fact Databases and Freewares] RIKEN Natural Products Encyclopedia (RIKEN NPEdia),a Chemical Database of RIKEN Natural Products Depository (RIKEN NPDepo)
2006
·
Takeshi Tomiki
, Tamio Saito
, et al.
·
Journal of Computer Aided Chemistry
·
29
PDF
Winged Scapula: Case Occurring in Soldier From Knapsack
1942
·
Frederic W. Ilfeld
·
JAMA
·
29
New Bleichenbacher Records: Fault Attacks on qDSA Signatures
2018
·
Akira Takahashi
, Mehdi Tibouchi
, et al.
·
IACR Transactions on Cryptographic Hardware and Embedded Systems
·
28
PDF
The Three Pillars of Natural Product Dereplication. Alkaloids from the Bulbs of Urceolina peruviana (C. Presl) J.F. Macbr. as a Preliminary Test Case
2021
·
Mariacaterina Lianza
, Ritchy Leroy
, et al.
·
Molecules
·
25
PDF
The knapsack and pack; an historical and physiological survey with particular reference to the British soldier.
1954
·
E T RENBOURN
·
PubMed
·
24
Mechanism Design without Money via Stable Matching
2011
·
Chen, Ning
, Gravin, Nick
, et al.
·
arXiv (Cornell University)
·
23
PDF
Bounding the Running Time of Algorithms for Scheduling and Packing Problems
2013
·
Klaus Jansen
, Felix Land
, et al.
·
Lecture notes in computer science
·
22
PDF
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
2012
·
Mohammadhossein Bateni
, Mohammadtaghi Hajiaghayi
·
ACM Transactions on Algorithms
·
22
Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima
2010
·
Dirk Sudholt
·
Algorithmica
·
22
Assignment Problem in Content Distribution Networks: Unsplittable Hard-capacitated Facility Location
2009
·
Mohammad Hossein Bateni
, Mohammad Taghi Hajiaghayi
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
21
General bounds for incremental maximization
2020
·
Aaron Bernstein
, Yann Disser
, et al.
·
Mathematical Programming
·
20
PDF
[Dedicated to Prof. T. Okada and Prof. T. Nishioka: data science in chemistry]DPClusOST: A Software Tool for General Purpose Graph Clustering
2017
·
Mohammad Bozlul Karim
, Nobutaka Wakamatsu
, et al.
·
Journal of Computer Aided Chemistry
·
20
PDF
Show more works
View as search
Works count:
213
Citation count:
3,648
Year
Topic
Type