Results 51 to 60 of about 28,490 (215)
MathematicsThe knapsack problem is a typical bi-objective combinatorial optimization issue, wherein maximizing the value of the packed items is achieved concurrently with minimizing the weight of the load.
Ziqian Wang +6 more
doaj +1 more source
Polynomial Kernels for Weighted Problems
, 2015 Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations ...
A Frank +16 more
core +1 more source
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
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Abdul-Hamid, F, Mitra, G, Yarrow, L
core
Scheduling Monotone Moldable Jobs in Linear Time
, 2018 A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it.
Jansen, Klaus, Land, Felix
core +1 more source
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 +9 more
wiley +1 more source
Dependent randomized rounding for clustering and partition systems with knapsack constraints
, 2020 Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among the cluster ...
Harris, David G. +3 more
core
An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1 Knapsack Problem
, 2010 Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained
Hota, Ashish Ranjan, Pat, Ankit
core +1 more source
Surrogate Assisted Optimisation for Travelling Thief Problems
, 2020 The travelling thief problem (TTP) is a multi-component optimisation problem involving two interdependent NP-hard components: the travelling salesman problem (TSP) and the knapsack problem (KP).
Namazi, Majid +3 more
core +1 more source
Exploring drivers and costs of partial trans‐Saharan migration in juvenile vultures
Ibis, EarlyView.Partial migration occurs when only a subset of individuals within a population undertakes a migratory journey. The decision to migrate can be influenced by intrinsic traits (e.g. sex or physical condition) as well as by extrinsic factors (e.g. social environment or resource availability).
Eneko Arrondo +18 more
wiley +1 more source