Abstract: In the context of maintaining a constant total running time for the entire line, current strategies for running time allocation fail to achieve optimal total energy consumption. Furthermore, ...

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

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

Uncertainties are widespread in the optimization of process systems, such as uncertainties in process technologies, prices, and customer demands. In this paper, we review the basic concepts and recent ...

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...