Results 11 to 20 of about 24,926 (205)
A novel approach for solving travelling thief problem using enhanced simulated annealing [PDF]
PeerJ Computer Science, 2021 Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques.
Hamid Ali +5 more
doaj +2 more sources
Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem
JOIV: International Journal on Informatics Visualization, 2020 This paper will point of convergence on a relative assessment and estimation of the dynamic programming, B&B, Greedy and Genetic algorithm including of the intricacy of time prerequisites, and the necessary programming endeavors and inspect the absolute ...
Yogesh Awasthi, Ashish Sharma
doaj +1 more source
Nature-inspired optimization algorithms in knapsack problem: A review [PDF]
المجلة العراقية للعلوم الاحصائية, 2019 Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem.
Ghalya Tawfeeq Basheer, Zakariya Algamal
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
An Exact Algorithm for Bilevel 0‐1 Knapsack Problems [PDF]
Mathematical Problems in Engineering, 2012 We propose a new exact method for solving bilevel 0‐1 knapsack problems. A bilevel problem models a hierarchical decision process that involves two decision makers called the leader and the follower. In these processes, the leader takes his decision by considering explicitly the reaction of the follower.
Mansi, Raid +3 more
openaire +3 more sources
Novel Discrete Differential Evolution Algorithm for Solving D{0-1}KP Problem [PDF]
Jisuanji kexue yu tansuo, 2022 The discounted {0-1} knapsack problem (D{0-1}KP) is a more complex variant of the classic 0-1 knap-sack problem (0-1KP). In order to efficiently solve the D{0-1}KP by using discrete differential evolution algorithm, firstly, a novel V-shape transfer ...
ZHANG Fazhan, HE Yichao, LIU Xuejing, WANG Zekun
doaj +1 more source
Reoptimizing the 0–1 knapsack problem
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ARCHETTI, Claudia +2 more
openaire +3 more sources
A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Entropy, 2014 Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems.
Zhaolu Guo +4 more
doaj +1 more source
Regarding the failure of applying the conventional 2-approximation algorithm to the collapsing knapsack problem [PDF]
, 2014 We show that the conventional 2-approximation algorithm for the classical 0?1 knapsack problem does not work for the collapsing knapsack problem in general.
Iida Hiroshi
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