Abstract: The present study integrated a discrete search equation to develop a discrete improved artificial bee colony (DiABC) algorithm. A random binary population was added in the initialization.

Department of Engineering Technology, Savannah State University, Savannah, GA, USA. Our analysis reveals that most claimed applications of Grover’s algorithm fall into one of several categories: Those ...

Aqarios' platform Luna v1.0 marks a major milestone in quantum optimization. This release significantly improves usability, performance, and real-world applicability by introducing FlexQAOA, a hybrid ...

This repository contains a set of 1787 feasible instances for the 0-1 Knapsack Problem with Group Fairness. The instances are in folder instances and the generator used to create them is in folder ...

Abstract: To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack ...

The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...