Results 61 to 70 of about 43,488 (185)

Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division

IEEE Access, 2019
Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model.
Lian Ye, Jinhang Zheng, Ping Guo, Mario J. Perez-Jimenez   +3 more
doaj   +1 more source

Knapsack Balancing via Multiobjectivization

Applied Sciences
In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when ...
Ignacy Kaliszewski, Janusz Miroforidis
doaj   +1 more source

Knapsack Problem Solution based on Knapsack Packing Tree Search

Безопасность информационных технологий, 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, Georgii Ivanovich Borzunov   +1 more
doaj  

SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM

Journal of Engineering, 2005
Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea, Deldar Ibrahem Abdo Al-Rahman   +1 more
doaj   +1 more source

Using Genetic Algorithm to Break Knapsack Cipher with Sequence Size 16

Iraqi Journal for Computers and Informatics, 2014
With the growth of networked system and applications such as eCommerce, the demand for effective internet security is increasing. Cryptology is the science and study of systems for secret communication.
Safaa Omran, Ali Al_Khalid, Israa Ali
doaj   +1 more source

Construction of Generating Feasible Subsets in the Knapsack Problem

Доклады Белорусского государственного университета информатики и радиоэлектроники
A method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed.
S. V. Chebakov, L. V. Serebryanaya
doaj   +1 more source

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

Substantiation of a heuristic algorithm in the knapsack problem

Nauka 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а, А.В. Gоrbоvа, А.А. Bоsоv   +2 more
doaj  

Efektivitas dan Efisiensi Drone Sprayer untuk Pengendalian Gulma pada Tanaman Padi (Oryza sativa L)

Agriprima: Journal of Applied Agricultural Sciences
Sawi Caisim (Brassica chinensis var. parachinensis) ialah tanaman sayuran yang memiliki nilai Drone sprayer merupakan inovasi yang digunakan untuk aplikasi pestisida.
Mochamad Syarief, Dwi Rahmawati, Mujiono, Lia Dina Fittryah   +3 more
doaj   +1 more source

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

Mathematics
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, Xin Huang, Yan Zhang, Danju Lv, Wei Li, Zhicheng Zhu, Jian’e Dong   +6 more
doaj   +1 more source