Results 81 to 90 of about 36,372,437 (161)

Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem

, 2019
The 0/1 multidimensional knapsack problem is the 0/1 knapsack problem with m constraints which makes it difficult to solve using traditional methods like dynamic programming or branch and bound algorithms.
Shalin Shah
core   +1 more source

Binary artificial bee colony algorithm for solving 0-1 knapsack problem [PDF]

, 2012
 In this paper, a binary artificial bee colony (BABC) algorithm is proposed to solve the 0-1 Knapsack problem. Unlike the original ABC algorithm, the proposed BABC represents a food source as a discrete binary variable and applies discrete operators
Niu B(牛奔), Liu W(刘微), Chen HN(陈瀚宁)   +2 more
core  

0-1 Knapsack problem [PDF]

, 2019
Tato Bakalářská práce se zabývá problémem batohu 0-1 a přístupy hledajícími jeho optimální řešení. V práci je implementován v jazyce C++ algoritmus založený na metodě větví a mezí, dále algoritmus založený na metodě dynamického programování a metoda ...
Jakub Pečenka
core  

Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

, 2011
0-1 knapsack problem is a typical combinatorial optimization question in the design and analysis of algorithms. The mathematical description of the knapsack problem is given in theory. The 0-1 knapsack problem is solved by ant colony optimistic algorithm
Rong Li, Zhi Jun Hu
core   +1 more source

On E-kKP as a knapsack problem related to the conventional 2-approximation algorithm for the 0-1 knapsack problem [PDF]

, 2015
This piece picks up E-kKP as a knapsack problem in relation to the conventional and the simplest 2-approximation algorithm for the 0-1 knapsack problem.
Iida, Hiroshi, 546
core   +1 more source

An Intelligent Method for Customizable Adaptive Learning Content Generation

International Journal of Information and Communication Technology Research, 2011
E-learning environments are being used more efficiently by the rapid growth in internet and multimedia technologies. Adaptive learning is a kind of learning environment which provides individual learning.
Ehsan Haghshenas, Arya Mazaheri, Ameneh Gholipour, Maryam Tavakoli   +3 more
doaj  

Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application

Journal of King Saud University: Computer and Information Sciences
This paper examines the performance of three binary metaheuristic algorithms when applied to two distinct knapsack problems (0–1 knapsack problems (KP01) and multidimensional knapsack problems (MKP)).
Mohamed Abdel-Basset, Reda Mohamed, Safaa Saber, Ibrahim M. Hezam, Karam M. Sallam, Ibrahim A. Hameed   +5 more
doaj   +1 more source

An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

, 2018
The knapsack problem is one of the most studied combinatorial optimisation problems with various practical applications. In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard ...
Yongquan Zhou, Zhou, Yongquan, Mohamed Abdel Basset, Abdel-Basset, Mohamed   +3 more
core   +1 more source

Solving the 0/1 knapsack problem by a biomolecular DNA computer. [PDF]

Adv Bioinformatics, 2013
Taghipour H, Rezaei M, Esmaili HA.
europepmc   +1 more source

Ant colony optimization algorithm for the 0-1 knapsack problem [PDF]

, 2015
This article describes a new ant colony optimisation algorithm for the discrete knapsack problem with a new heuristic pattern, based on the ratio of the square of the profit coefficient to the square of the weight coefficient of the original problem ...
Schiff, Krzysztof
core