Get started
Keyword

knapsack problem

Description: A combinatorial optimization problem that selects items with given values and weights to maximize total value without exceeding a capacity constraint.
Wikidata ID: wiki/Q864457
OpenAlex ID: keywords/knapsack-problem
The Price of Robustness
2004 · Dimitris Bertsimas, Melvyn Sim · Operations Research · 4,610
Knapsack Problems: Algorithms and Computer Implementations
1991 · David Connolly, Silvano Martello, et al. · Journal of the Operational Research Society · 3,120
Modern heuristic techniques for combinatorial problems
1993 · Colin R. Reeves · Medical Entomology and Zoology · 2,610
Approximation algorithms for combinatorial problems
1974 · David S. Johnson · Journal of Computer and System Sciences · 2,211
PDF
Knapsack Problems
2004 · Hans Kellerer, Ulrich Pferschy, et al. · Springer eBooks · 1,895
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
2002 · Kuk-Hyun Han, Jong-Hwan Kim · IEEE Transactions on Evolutionary Computation · 1,585
Knapsack problems, algorithms and computer implementations
1991 · Jeroen De Kort · European Journal of Operational Research · 1,402
Finding the k Shortest Paths
1998 · David Eppstein · SIAM Journal on Computing · 1,382
A Design Principle for Hash Functions
2007 · Ivan Bjerre Damgård · Springer eBooks · 1,188
PDF
A typology of cutting and packing problems
1990 · Harald Dyckhoff · European Journal of Operational Research · 1,110
A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems
2021 · Shanu Verma, Millie Pant, et al. · IEEE Access · 982
PDF
Hiding information and signatures in trapdoor knapsacks
1978 · R. Merkle, M. Hellman · IEEE Transactions on Information Theory · 827
Exact Algorithms for NP-Hard Problems: A Survey
2003 · Gerhard J. Woeginger · Lecture notes in computer science · 679
Genetic quantum algorithm and its application to combinatorial optimization problem
2002 · Kuk-Hyun Han, Jong-Hwan Kim · IEEE Congress on Evolutionary Computation (CEC) · 672
`` Strong '' NP-Completeness Results
1978 · M. R. Garey, D. S. Johnson · Journal of the ACM · 664
PDF
Knapsack Problems: Algorithms and Computer Implementations
1991 · David Connolly · Journal of the Operational Research Society · 647
Neural Combinatorial Optimization with Reinforcement Learning
2016 · Bello, Irwan, Pham, Hieu, et al. · arXiv (Cornell University) · 645
PDF
Knapsack-type cryptosystems and algebraic coding theory
1986 · Harald Niederreiter · Medical Entomology and Zoology · 590
Computing Partitions with Applications to the Knapsack Problem
1974 · Ellis Horowitz, Sartaj Sahni · Journal of the ACM · 569
PDF
On the computational complexity of reliability redundancy allocation in a series system
1992 · Maw-Sheng Chern · Operations Research Letters · 544
Multicasting in delay tolerant networks
2009 · Wei Gao, Qinghua Li, et al. · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · 538
An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems
2013 · George Mavrotas, Kostas Florios · Applied Mathematics and Computation · 482
Quantum-Inspired Evolutionary Algorithms With a New Termination Criterion, $H_epsilon $ Gate, and Two-Phase Scheme
2004 · K.-H. Han, J.-H. Kim · IEEE Transactions on Evolutionary Computation · 482
Min–max and min–max regret versions of combinatorial optimization problems: A survey
2008 · Hassene Aissi, Cristina Bazgan, et al. · European Journal of Operational Research · 481
Algorithms for Knapsack Problems
1987 · Silvano Martello, Paolo Toth · North-Holland mathematics studies · 467
Works count: 5,172
Citation count: 80,100
Year
Topic
Type