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

Dynamic programming is a powerful technique for solving optimization problems that can be divided into smaller sub-problems. The main idea of dynamic programming is to avoid recomputing the same ...

I'm a software developer and writer, passionate about learning and sharing knowledge and one way I do that is through writing. I'm a software developer and writer, passionate about learning and ...

Abstract: With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management.

This paper presents a continuous method for solving binary quadratic programming problems. First, the original problem is converted into an equivalent continuous optimization problem by using NCP ...