We consider integer programming problems in standard form max c T x: Ax= b, x⩾ 0, x∈ Z n
where A∈ Z m× n, b∈ Z m, and c∈ Z n. We show that such an integer program can be …

Given a (multi) set S of n positive integers and a target integer u, the subset sum problem is
to decide if there is a subset of S that sums up to u. We present a series of new algorithms …

We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for
pairs of items which are not allowed to be packed together into the knapsack. These …

Collaborative filtering is an emerging technology to deal with information overload problem
guiding customers by offering recommendations on products of possible interest. Forming …

For multiobjective optimization problems, it is meaningful to compute a set of solutions
covering all possible trade-offs between the different objectives. The multiobjective …

Complex event processing (CEP) systems that evaluate queries over streams of events may
face unpredictable input rates and query selectivities. During short peak times, exhaustive …

We consider an uncertain variant of the knapsack problem in which the weight of the items is
not exactly known in advance, but belongs to a given interval, and an upper bound is …

Energy is the most precious resource in wireless sensor networks. To ensure sustainable
operations, wireless sensor systems need to harvest energy from environments. The time …

We consider a generalization of the knapsack problem in which items are partitioned into
classes, each characterized by a fixed cost and capacity. We study three alternative Integer …

In order to achieve an efficient energy consumption level in the residential sector of a smart
grid, the end-users are equipped with various smart home energy controller technologies …