IEEE

Dynamic Programming Algorithm using Furniture Industry 0/1 Knapsack Problem

Abstract: Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack ...
IEEE

Approximation and Heuristic Algorithms for the Priority Facility Location Problem with Outliers

Abstract: In this paper, we propose the Priority Facility Location Problem with Outliers (PFLPO), which is a generalization of both the Facility Location Problem with Outliers (FLPO) and Priority ...