16 search results - page 1 / 4 » Partially ordered knapsack and applications to scheduling |
DAM
2007
13 years 4 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
AIPS
2007
13 years 7 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
This paper describes the application of an arti cial immune system, AIS , model to a scheduling application, in which sudden changes in the scheduling environment require the rap...