This project implements the ε-greedy algorithm to solve the Multi-Armed Bandit (MAB) problem, which is a classic reinforcement learning scenario. The primary challenge in this problem is ...

This repository includes the implementation of an iterated greedy algorithm [1] in Python to define the community structure in complex networks. The iterated greedy algorithm consists of two main ...

Abstract: The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the importance of such problems to economics ...

Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...