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.

Abstract: In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, ...

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 ...

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 ...

The "knapsack problem" is a widespread computing challenge—and no, it doesn't have to do just with literal backpacks. golubovy / iStock Imagine you’re a thief robbing a museum exhibit of tantalizing ...

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...