Results 61 to 70 of about 4,775,611 (190)
Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization
IEEE AccessThe 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in the real world such as in resource allocation, logistics ...
Rhiddhi Prasad Das +3 more
doaj +1 more source
Deep Reinforcement Learning Algorithms for Heterogeneous Multiple Knapsack Problems [PDF]
Jisuanji gongchengBy focusing on the traditional multi-Knapsack Problem (KP) in typical logistics system operations, this study abstracts a Heterogeneous Multiple Knapsack Problem (HMKP) and formulates an improved Deep Deterministic Policy Gradient (DDPG) algorithm to ...
LI Bin, GUO Yi
doaj +1 more source
Enhancing Recharge Beneath Low‐Permeability Landscapes with Small‐Diameter Drywells: Token Creek, WI
Groundwater, EarlyView.Shallow, small‐diameter drywells provide enhanced recharge in rural landscapes, bypassing the low infiltration rates caused by low permeability surficial soils and high ET rates. One year of monitoring data show several recharge events and overall high water quality.
Samantha C. Kershner +2 more
wiley +1 more source
The Howard Journal of Crime and Justice, EarlyView.ABSTRACT Drawing on qualitative data among a sample of people leaving prison in Aotearoa New Zealand, this article explores how post‐prison transitional housing impacts desistance from crime and motivation to desist. While transitional housing is designed to support reintegration, our findings reveal that it can also produce unintended impacts—or ...
Alice Mills +2 more
wiley +1 more source
Complexity results and exact algorithms for robust knapsack problems. [PDF]
This paper studies the robust knapsack problem, for which solutions are, up to a certain point, immune to data uncertainty. We complement the works found in the literature where uncertainty affects only the profits or only the weights of the items by ...
Leus, Roel, Talla Nobibon, Fabrice
core
A Hybridization of Dragonfly Algorithm Optimization and Angle Modulation Mechanism for 0-1 Knapsack Problems. [PDF]
Entropy (Basel), 2021 Wang L, Shi R, Dong J.
europepmc +1 more source
Ibis, EarlyView.With the rapid development of tracking technologies revealing fine‐scale information on animal movements, several methods have been developed to identify nesting behaviour in birds retrospectively. However, some research questions require nesting behaviour to be identified in real time such that nests and/or broods can be visually observed.
Ilsa A. Griebel +7 more
wiley +1 more source
, 2016 We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting classic
Sabharwal, Yogish +3 more
core +4 more sources
Безопасность информационных технологий, 2015 Keywords: In this paper, we propose a new approach to the definition of basic problems in a constructive enumeration of combinations of knapsack vector elements.
Georgii Ivanovich Borzunov +1 more
doaj
On Solving the Knapsack Problem with Conflicts
MathematicsA variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit.
Roberto Montemanni, Derek H. Smith
doaj +1 more source