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

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

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

We review encoding and hardware-independent formulations of optimization problems for quantum computing. Using this generalized approach, an extensive library of optimization problems from the ...

Aug 2: I'll have 2-hour office hours on Wed, Aug 7, 11:30-13:30. Aug 2: The final exam on Aug 9 will be on all topics of the course, with equal emphasis. You'll have 3 hours for an exam that will be ...

Abstract: This paper aims at comparing the serial, shared memory parallelization, and distributed memory parallelization of the dynamic programming algorithm for the Knapsack Problem. Knapsack Problem ...