Get started
Keyword

multiple knapsack problem

Description: The multiple knapsack problem is an optimization problem that assigns items to several capacity-limited containers to maximize total value.
OpenAlex ID: keywords/multiple-knapsack-problem
Knapsack Problems: Algorithms and Computer Implementations
1991 · David Connolly, Silvano Martello, et al. · Journal of the Operational Research Society · 3,120
Knapsack Problems
2004 · Hans Kellerer, Ulrich Pferschy, et al. · Springer eBooks · 1,895
The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm
2009 · Hamed Shah Hosseini · International Journal of Bio-Inspired Computation · 473
Routing in Socially Selfish Delay Tolerant Networks
2010 · Qinghua Li, Sencun Zhu, et al. · IEEE Conference on Computer Communications (INFOCOM) · 352
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
2005 · Chandra Chekuri, Sanjeev Khanna · SIAM Journal on Computing · 332
Exploiting heuristic algorithms to efficiently utilize energy management controllers with renewable energy sources
2016 · Sahar Rahim, Nadeem Javaid, et al. · Energy and Buildings · 300
A PTAS for the multiple knapsack problem
2000 · Chandra Chekuri, Sanjeev Khanna · ScholarlyCommons (University of Pennsylvania) · 278
PDF
An Optimized Home Energy Management System with Integrated Renewable Energy and Storage Resources
2017 · Adnan Ahmad, Asif Khan, et al. · Energies · 267
PDF
Maximum coverage capacitated facility location problem with range constrained drones
2019 · Darshan Chauhan, Avinash Unnikrishnan, et al. · Transportation Research Part C Emerging Technologies · 222
A new version of ant system for subset problems
2003 · G. Leguizamon, Z. Michalewicz · IEEE Congress on Evolutionary Computation (CEC) · 215
Intelligent mutation rate control in canonical genetic algorithms
1996 · Thomas Bäck, Martin Schütz · Lecture notes in computer science · 215
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
2022 · Valentina Cacchiani, Manuel Iori, et al. · Computers & Operations Research · 194
An exact algorithm for large multiple knapsack problems
1999 · David Pisinger · European Journal of Operational Research · 185
Energy Efficient Integration of Renewable Energy Sources in the Smart Grid for Demand Side Management
2018 · Nadeem Javaid, Ghulam Hafeez, et al. · IEEE Access · 173
Mixing mixed-integer inequalities
2001 · Oktay Günlük, Yves Pochet · Mathematical Programming · 170
Intelligent water drops algorithm
2008 · Hamed Shah‐Hosseini · International Journal of Intelligent Computing and Cybernetics · 169
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
2000 · M. Dawande, J. Kalagnanam, et al. · Journal of Combinatorial Optimization · 143
A simple evolutionary algorithm for multi-objective optimization (SEAMO)
2003 · C.L. Valenzuela · IEEE Congress on Evolutionary Computation (CEC) · 121
A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints
2003 · Michael A. Trick · Annals of Operations Research · 113
Hybrid meta-heuristic optimization based home energy management system in smart grid
2019 · Zahoor Ali Khan, Ayesha Zafar, et al. · Journal of Ambient Intelligence and Humanized Computing · 111
The Multiple Subset Sum Problem
2000 · Alberto Caprara, Hans Kellerer, et al. · SIAM Journal on Optimization · 111
Towards Optimization of Metaheuristic Algorithms for IoT Enabled Smart Homes Targeting Balanced Demand and Supply of Energy
2017 · Saqib Kazmi, Nadeem Javaid, et al. · IEEE Access · 96
PDF
On Two Class-Constrained Versions of the Multiple Knapsack Problem
2001 · H. Shachnai, T. Tamir · Algorithmica · 88
Heuristic algorithms for the multiple knapsack problem
1981 · S. Martello, P. Toth · Computing · 82
A routing protocol for socially selfish delay tolerant networks
2011 · Qinghua Li, Wei Gao, et al. · Ad Hoc Networks · 80
Works count: 469
Citation count: 13,250
Year
Topic
Type