Results 51 to 60 of about 33,491 (214)

Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models [PDF]

open access: yesInternational Journal of Mathematical, Engineering and Management Sciences, 2019
In this paper, a reformulation that was proposed for a knapsack problem has been extended to single and bi-objective linear integer programs. A further reformulation by adding an upper bound constraint for a knapsack problem is also proposed and extended
Masar Al-Rabeeah   +4 more
doaj   +1 more source

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

open access: yesMethods 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

Using incentive payments to promote human–carnivore coexistence

open access: yesConservation 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

Knapsack Problem Solution based on Knapsack Packing Tree Search

open access: yesБезопасность информационных технологий, 2014
A number of asymmetric cryptosystems (including one of the very first asymmetric cryptosystems – the Merkle–Hellman cryptosystem) are based on the knapsack problem.
Mikhail Andreevich Kupriyashin   +1 more
doaj  

Cryptanalysis of Knapsack Cipher Using Genetic Algorithm [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2007
This research offers a new method in Cryptanalysis of knapsack cipher. It focuses on the application of genetic algorithm as a modern way in solving complex problems (problems have a huge numbers of alternate solutions in appropriate time).
Subhi Hamdon   +2 more
doaj   +1 more source

Exploring drivers and costs of partial trans‐Saharan migration in juvenile vultures

open access: yesIbis, 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

Substantiation of a heuristic algorithm in the knapsack problem

open access: yesNauka ta progres transportu, 2012
Introduction: Formed knapsack problem in terms of set functions and is a heuristic algorithm. The goal: to prove that the heuristic algorithm is essential. Some facts from [2].
Н.В. KHalipovа   +2 more
doaj  

Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance

open access: yesMathematics
The 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

Multiobjective Knapsack Problem with Equity Concerns

open access: yesGazi Üniversitesi Fen Bilimleri Dergisi, 2018
In this paper, a multi-objective mathematical modeling approach has been developed for resource distribution problem which has equity concerns. We assume that the preference model of the decision maker satisfies properties related to inequity-aversion ...
Özlem KARSU
doaj   +1 more source

Fair Knapsack

open access: yes, 2018
We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value.
Fluschnik, Till   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy