Results 51 to 60 of about 24,926 (205)

Approximation Schemes for 0-1 Knapsack [PDF]

, 2018
We revisit the standard 0-1 knapsack problem. The latest polynomial-time approximation scheme by Rhee (2015) with approximation factor 1+eps has running time near O(n+(1/eps)^{5/2}) (ignoring polylogarithmic factors), and is randomized.
Chan, Timothy M.
core   +1 more source

Dynamic Resource Allocation Optimisation and Security‐Resilient Control for Bandwidth‐Limited Network Control Systems With Data Conflicts

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen, Kaibo Shi, Bin Guo, Kangkang Sun, Huaicheng Yan, Xiao Cai   +5 more
wiley   +1 more source

Reinforcement learning-assisted multi-layered binary exponential distribution optimizer for 0–1 knapsack problem

Journal of King Saud University: Computer and Information Sciences
The 0–1 knapsack problem (0-1KP) is a well-known discrete combinatorial optimization problem with various applications across multiple fields. Compared with traditional methods, metaheuristic algorithms show higher efficiency and flexibility in solving ...
Fengbin Wu, Shaobo Li, Junxing Zhang, Libang Wu, Panliang Yuan, Mingbao Yang   +5 more
doaj   +1 more source

List-Based Threshold Accepting Algorithm with Improved Neighbor Operator for 0–1 Knapsack Problem

Algorithms
The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm.
Liangcheng Wu, Kai Lin, Xiaoyu Lin, Juan Lin   +3 more
doaj   +1 more source

On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle

Foundations of Computing and Decision Sciences, 2022
The growing need for profit maximization and cost minimization has made the optimization field very attractive to both researchers and practitioners.
Laabadi Soukaina, Naimi Mohamed, Amri Hassan El, Achchab Boujemâa   +3 more
doaj   +1 more source

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits

, 2016
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type.
Bazzi, Abbas, Fiorini, Samuel, Huang, Sangxia, Svensson, Ola   +3 more
core   +1 more source

A novel approach for distinguishing noise and information in forest MLS‐point clouds

Methods in Ecology and Evolution, EarlyView.
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, Pascal Rochon, Philippe Nolet   +2 more
wiley   +1 more source

A suitable approach to resource allocation in biosecurity when considering dependent benefits and costs

Methods in Ecology and Evolution, EarlyView.
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 Constant Factor Approximation Algorithm for Unsplittable Flow on Paths [PDF]

, 2011
In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices.
Bonsma, Paul, Schulz, Jens, Wiese, Andreas   +2 more
core   +2 more sources

Using incentive payments to promote human–carnivore coexistence

Conservation Biology, EarlyView.
Abstract For many large carnivores, minimizing the financial burden they impose on local people is critical to their conservation. Incentive‐based programs that provide people with financial benefits for taking pro‐conservation actions or achieving conservation goals are a promising tool for promoting human–carnivore coexistence. Although the number of
Adam Pekor, Ingela Jansson, Ololotu Munka, William Ole Seki, Sally Capper, Bernard Kissui, Göran Bostedt, Camilla Sandström, Dennis Rentsch, Travis Gallo   +9 more
wiley   +1 more source