This paper solves the binary single-constrained Knapsack Problem (KP) and undertakes a sensitivity analysis of its optimum solution. Given a knapsack of capacity c, and a set of n items, with each item j, j = 1,…,n, characterised by a weight wj and a profit pj, the binary...

We consider the problem of scheduling multiple projects subject to joint resource constraints. Most approaches proposed in the literature so far are based on the unrealistic assumption that resources can be transferred from one project to the other without any expense in time or cost. In order...

The classical binary knapsack problem has numerous generalisations in relation to not only a capacity constraint but also an objective function. In 2006, two knapsack problems have coincidentally been proposed, both of which have an extension of the objective function paying the penalty. This...

In dem vorliegenden Beitrag wird ein Modell für die effiziente Allokation von Infrastruktureinrichtungen in einer Region entwickelt. Die Komplexität des Allokationsproblems ergibt sich nicht nur durch die Vielzahl der Kombinationsmöglichkeiten, sondern auch durch die immanenten...