... This paper presents an Ant Colony (AC) model for the MultipleKnapsackProblem (MKP). The ant colony metaphor, as well as other evolutionary metaphors, was applied successfully to diverse heavily ...
... Zero/One MultipleKnapsackProblem and Zero/One KnapsackProblem have been intensively studied using different traditional methods, such as Branch-and-Bound and Dynamic Programming ...
... using multiple processors operating together on a single ...overall problem is split into parts, each of which is operated by a separate processor in par- ...the problem and the amount of par- ...
... was deduced from a more general statement involving a functional relation of a Lerch type Tornheim double zeta function. Nakamura gives a very elegant proof using elementary combinatorial facts and the analytic ...
... If you ask the man on the street how to change minds, he is likely to say ‘Use rewards or punishments.” This lay theory, right out of behaviorism, is attractive to many persons. The problem with the reinforcement ...
... vector de decisiones binarias. Tambi´en han sido utilizadas o extendidas para poder cu- brir problemas de cubrimiento m´as generales. En esta l´ınea, Carnes y Shmoys (2015) dan un generalizaciones de las KCI para el ...
... underlying problem is defined in recursive terms and it is difficult to reformulate it as an iterative ...the knapsackproblem is considered as an ...
... optimization problem (MOOP), a solution has a number of objective values, one per each optimizing criterion ...decision-making problem for choosing a suitable solution (or set of solutions) according to ...