The Temporal Knapsack Problem and Its Solution

Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a multiprocessor to bids for the resources. The algorithms considered use and combine techniques from constraint programming, artificial intelligence and operations research.

• Type: Conference
• Year: 2005
• Where: CPAIOR
• Authors: Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth
• Keywords: Communication Bandwidth, CPAIOR 2005, Knapsack Problem, Temporal Knapsack Problem