Results 41 to 50 of about 43,488 (185)
Mushroom picking heuristics framework for knapsack-like problems of resource allocation
Zeszyty Naukowe Wyższej Szkoły Finansów i Prawa w Bielsku-BiałejResource allocation is a complex challenge that extends across diverse disciplines, each presenting its distinct considerations and demands. This intricate task involves the distribution of resources in a manner that meets the needs and objectives of ...
Kateryna Czerniachowska
doaj +1 more source
An enumerative procedure for identifying maximal covers
Revista de Matemática: Teoría y Aplicaciones, 2009 In this paper we present an enumerative procedure for identifying all maximal covers from the set of covers implied by a 0-1 knapsack constraint. The inequalities induced by these maximal covers are not dominated by the inequality induced by any other ...
Susana Muñoz
doaj +1 more source
The Indian Journal of Agricultural Sciences, 2020 A multi-purpose high clearance sprayer was developed with three types of spraying mechanism, viz. auto-rotate gun, drop-up boom and boom nozzles. The experiment was conducted during 2016 at Abohar in cotton growing region of South-western Punjab at six ...
Santosh Kumar +3 more
doaj +1 more source
PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density
Information, 2019 By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit
Yuan Ping +4 more
doaj +1 more source
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
Topology Knapsack Problem for Geometry Optimization
IEEE AccessThe knapsack problem is a classic NP-hard optimization challenge with wide-ranging applications in computer science, such as resource allocation. While several variants have been developed, including the 0/1, fractional, and multi-dimensional knapsack ...
Hsiao-Hui Li +2 more
doaj +1 more source
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
IEEE Access, 2019 The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang +4 more
doaj +1 more source
Cryptanalysis of Knapsack Cipher Using Genetic Algorithm [PDF]
Al-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
Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem
Mathematics, 2021 The knapsack problem is one of the most widely researched NP-complete combinatorial optimization problems and has numerous practical applications. This paper proposes a quantum-inspired differential evolution algorithm with grey wolf optimizer (QDGWO) to
Yule Wang, Wanliang Wang
doaj +1 more source