A Binary Hiking Optimization Algorithm for 0/1 Knapsack Problem
Published in The Eurasia Proceedings of Science, Technology, Engineering and Mathematics • Jul 31, 2026
NobleIDNI5P762W777R950S122
Authors:
Aybuke Babadag
Abstract
The 0/1 knapsack problem is one of the prominent NP-hard binary optimization problems. Solving such problems using exact methods can be computationally expensive. Therefore, metaheuristic methods which offer optimal or near optimal solutions in a reasonable time, are commonly utilized for such tasks...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!