Abstract: In this paper, the discrete economic dispatch problem is formulated as a knapsack problem. An effective distributed strategy based on distributed dynamic programming algorithm is proposed to ...

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

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