Results 91 to 100 of about 25,976 (248)
Sensitivity analysis of the greedy heuristic for binary knapsack problems [PDF]
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results.
Chakravarti, N., Ghosh, D., Sierksma, G.
core +1 more source
Solving Multidimensional 0-1 Knapsack Problem by P Systems with Input and Active Membranes [PDF]
, 2004 P systems are parallel molecular computing models based on pro- cessing multisets of objects in cell-like membrane structures. In this paper we give a membrane algorithm to multidimensional 0-1 knapsack problem in lin- ear time by recognizer P systems
Martín Vide, Carlos, Pan, Linqiang
core
Reviews in Aquaculture, Volume 18, Issue 3, June 2026.ABSTRACT Monogeneans are among the most problematic ectoparasites in finfish aquaculture. Plant‐derived compounds have been widely explored as therapeutic agents, yet their efficacy and safety have not been quantitatively synthesized across studies. This study provides a meta‐analysis of plant‐based treatments against monogeneans, integrating 453 in ...
Francisco Neptalí Morales‐Serna
wiley +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
A novel approach for distinguishing noise and information in forest MLS‐point clouds
Methods in Ecology and Evolution, Volume 17, Issue 5, Page 1595-1605, May 2026.Abstract 3D laser scanning is a cornerstone of modern forest and ecological research, allowing detailed insight into forest structures and dynamics. Although point cloud processing and noise management are crucial steps in the exploitation of LiDAR data, traditional denoising methods are usually based on the assumption of a Gaussian noise distribution,
Marie‐Eve Charlebois +2 more
wiley +1 more source
Transport Logistics Optimization Model Of Passenger Car Based On Heuristic Algorithm
MATEC Web of Conferences, 2016 Passenger car logistics transportation problem is at the primary stage of development in China, great economic loss and waste of resources caused in the process of logistics transportation, because most of enterprises in China rely on artificial ...
Zhou Juan +3 more
doaj +1 more source
IEEE Access, 2018 List-based simulated annealing (LBSA) algorithm, which uses list-based cooling scheme to control the change of parameter temperature, was first proposed for traveling salesman problem. This paper extends the application of LBSA algorithm for 0-1 knapsack
Shi-Hua Zhan +3 more
doaj +1 more source
Methods in Ecology and Evolution, Volume 17, Issue 5, Page 1519-1534, May 2026.Abstract Optimal allocation of resources to the management of biosecurity risk, threatened species conservation or natural hazards such as bushfires is imperative—because program budgets are usually finite and, therefore, constrained. However, effectively dividing resources among management activities to achieve the greatest benefit remains a ...
Aaron Dodd, Edith Arndt, Anca Hanea
wiley +1 more source
A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem
AlgorithmsThe harmony search (HS) algorithm is a novel metaheuristic which has been widely used to solve both continuous and discrete optimization problems. In order to improve the performance and simplify the implementation of the HS algorithm for solving the 0-1
Fuyuan Zheng +5 more
doaj +1 more source
Reoptimization in lagrangian methods for the quadratic knapsack problem
, 2012 International audienceThe 0-1 quadratic knapsack problem consists in maximizing a quadratic objective function subject to a linear capacity constraint. To solve exactly large instances of this problem with a tree search algorithm (e.g. a branch and bound
Létocart, Lucas +2 more
core +1 more source