Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of ...

ABSTRACT: This study presents the Dynamic Multi-Objective Uncapacitated Facility Location Problem (DMUFLP) model, a novel and forward-thinking approach designed to enhance facility location decisions ...

Children with hemophilia have problems with dynamic balance — the ability to maintain balance while moving — and an increased risk of falls compared with healthy peers, according to a new study by two ...

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

This is an implementation of the 0-1 knapsack problem in C using dynamic programming. The problem consists of a set of items, each with a weight and a value, and a knapsack with a maximum weight ...

Abstract: Many dynamic programming approaches are existing for 1-0 Knapsack problem (KP) for fast GPU-based solution. These dynamic programming methods can be used for solving the problem of Bounded ...